71 search results - page 1 / 15 » Integer programming formulations for the elementary shortest... |
NETWORKS
2008
13 years 5 months ago
2008
The resource-constrained elementary shortest path problem arises as a pricing subproblem in branch-and-price algorithms for vehicle routing problems with additional constraints. W...
HEURISTICS
2002
13 years 5 months ago
2002
Given a graph G, the Shortest Capacitated Paths Problem (SCPP) consists of determining a set of paths of least total length, linking given pairs of vertices in G, and satisfying c...
4OR
2010
13 years 3 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...
CPAIOR
2009
Springer
13 years 12 months ago
2009
Springer
Abstract. The multileaf collimator sequencing problem is an important component in effective cancer treatment delivery. The problem can be formulated as finding a decomposition of...
VTC
2006
IEEE
13 years 11 months ago
2006
IEEE
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...