Minimum cost path problems with relays
From MaRDI portal
Publication:709122
DOI10.1016/j.cor.2010.04.010zbMath1231.90108OpenAlexW2055093681MaRDI QIDQ709122
Gilbert Laporte, Marta M. B. Pascoal
Publication date: 15 October 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2010.04.010
Extremal problems in graph theory (05C35) Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10)
Related Items (11)
The electric vehicle shortest-walk problem with battery exchanges ⋮ Branch-and-price approaches for the network design problem with relays ⋮ Path based algorithms for metro network design ⋮ A variable neighborhood search for the network design problem with relays ⋮ A directional heuristics pulse algorithm for a two resources constrained shortest path problem with reinitialization ⋮ Exact Approaches for Network Design Problems with Relays ⋮ Traffic equilibrium and charging facility locations for electric vehicles ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Solving shortest path problems with a weight constraint and replenishment arcs ⋮ Range-constrained traffic assignment with multi-modal recharge for electric vehicles ⋮ A survey of resource constrained shortest path problems: Exact solution approaches
Cites Work
- On a multicriteria shortest path problem
- The network design problem with relays
- An empirical investigation of some bicriterion shortest path algorithms
- A label correcting approach for solving bicriterion shortest-path problems
- The Black and White Traveling Salesman Problem
- Wide area telecommunication network design: application to the Alberta SuperNet
- On the Theory of Dynamic Programming
- Label correcting methods to solve multicriteria shortest path problems
- Unnamed Item
This page was built for publication: Minimum cost path problems with relays
