Sciweavers

239 search results - page 46 / 48
» The path partition problem and related problems in bipartite...
Sort
View
EOR
2008
106views more  EOR 2008»
13 years 7 months ago
Convergent Lagrangian heuristics for nonlinear minimum cost network flows
We consider the separable nonlinear and strictly convex single-commodity network flow problem (SSCNFP). We develop a computational scheme for generating a primal feasible solution...
Torbjörn Larsson, Johan Marklund, Caroline Ol...
EDBT
2009
ACM
162views Database» more  EDBT 2009»
14 years 2 months ago
A data model for trip planning in multimodal transportation systems
This paper introduces the problem of modeling urban transportation systems in a database where certain aspects of the data are probabilistic in nature. The transportation network ...
Joel Booth, A. Prasad Sistla, Ouri Wolfson, Isabel...
CIKM
2007
Springer
13 years 11 months ago
A fast unified optimal route query evaluation algorithm
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
Edward P. F. Chan, Jie Zhang
BIRTHDAY
2011
Springer
12 years 7 months ago
Algorithmic Aspects of Risk Management
Abstract. Risk analysis has been used to manage the security of systems for several decades. However, its use has been limited to offline risk computation and manual response. In c...
Ashish Gehani, Lee Zaniewski, K. Subramani
TOC
2008
104views more  TOC 2008»
13 years 7 months ago
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks
For an integer h 1, an elementary h-route flow is a flow along h edge disjoint paths between a source and a sink, each path carrying a unit of flow, and a single commodity h-rout...
Henning Bruhn, Jakub Cerný, Alexander Hall,...