Models for multi-path covering problems

DOI10.1023/A:1018923022243MaRDI QIDQ1270616zbMATH OpenFDO

Authors Brian Boffey, Subhash C. Narula

Publication date 8 December 1998

Published in Annals of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/A:1018923022243

zbMATH Keywords

Lagrangian relaxationmulti-path modelsmultiobjectivepath coveringroutingshortest path

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• scientific article; zbMATH DE number 1149858
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• The multicovering problem
• Efficient Algorithms for Solving the Shortest Covering Path Problem
• Heuristics for the multi-vehicle covering tour problem

Cited in

(7)

• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• Spatial coverage in routing and path planning problems
• Facility location with tree topology and radial distance constraints
• scientific article; zbMATH DE number 1149858 (Why is no real title available?)
• A Lagrangian relaxation approach for expansion of a highway network
• Strategic route extension in transit networks
• Bayesian coverage optimization models

This page was built for publication: Models for multi-path covering problems

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