Minimum cost path problems with relays

DOI10.1016/J.COR.2010.04.010zbMATH Open1231.90108OpenAlexW2055093681MaRDI QIDQ709122FDOQ709122

Authors: G. 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

Recommendations

• Minimum cost-reliability ratio path problem
• The network design problem with relays
• Minimum cost paths over dynamic networks
• Exact approaches for network design problems with relays
• Minimum-link paths revisited
• Minimum-cost line broadcast in paths
• scientific article; zbMATH DE number 4053314
• Branch-and-price approaches for the network design problem with relays
• Minimum cost flow problem
• Minimizing a stochastic maximum-reliability path

zbMATH Keywords

shortest path problembicriteria optimizationlabeling algorithmsrelays

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Deterministic network models in operations research (90B10) Extremal problems in graph theory (05C35)

Cites Work

• On the Theory of Dynamic Programming
• An empirical investigation of some bicriterion shortest path algorithms
• A label correcting approach for solving bicriterion shortest-path problems
• Title not available (Why is that?)
• On a multicriteria shortest path problem
• The network design problem with relays
• Label correcting methods to solve multicriteria shortest path problems
• The Black and White Traveling Salesman Problem
• Wide area telecommunication network design: application to the Alberta SuperNet

Cited In (15)

• Enhanced methods for the weight constrained shortest path problem
• Range-constrained traffic assignment with multi-modal recharge for electric vehicles
• Minimum cost-reliability ratio path problem
• Complexity results on labeled shortest path problems from wireless routing metrics
• Branch-and-price approaches for the network design problem with relays
• Exact approaches for network design problems with relays
• The network design problem with relays
• Multicriteria path and tree problems: discussion on exact algorithms and applications
• 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
• The electric vehicle shortest-walk problem with battery exchanges
• Solving shortest path problems with a weight constraint and replenishment arcs
• A survey of resource constrained shortest path problems: exact solution approaches
• Traffic equilibrium and charging facility locations for electric vehicles

This page was built for publication: Minimum cost path problems with relays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q709122)