The maximum covering/shortest path problem: A multiobjective network design and routing formulation

DOI10.1016/0377-2217(85)90030-XzbMath0569.90062OpenAlexW2045254727MaRDI QIDQ1060958

C. S. Re Velle, John R. Current, Jared L. Cohon

Publication date: 1985

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(85)90030-x

zbMATH Keywords

network designgeneral transportationmaximum covering/shortest path problemmaximum population/shortest path problemrouting analysistwo objective integer programs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10) Sensitivity, stability, parametric optimization (90C31)

Related Items (26)

Optimal path problems with second-order stochastic dominance constraints ⋮ Zero-one programming with multiple criteria ⋮ A modular capacitated multi-objective model for locating maritime search and rescue vessels ⋮ The hierarchical network design problem ⋮ A multicut L-shaped based algorithm to solve a stochastic programming model for the mobile facility routing and scheduling problem ⋮ Multiobjective routing problems ⋮ Algorithms for generating Pareto fronts of multi-objective integer and mixed-integer programming problems ⋮ Location-coverage models for preventing attacks on interurban transportation networks ⋮ The transit route arc-node service maximization problem ⋮ Multi-objective decision method for airport landside rapid transit network design ⋮ A minimum length covering subgraph of a network ⋮ Optimization methods for the planning of rapid transit systems ⋮ A Lagrangian relaxation approach for expansion of a highway network ⋮ On symmetric subtour problems ⋮ Multicriteria path and tree problems: discussion on exact algorithms and applications ⋮ Multiple criteria facility location problems: a survey ⋮ Concurrent optimization of harvesting and road network layouts under steep terrain ⋮ The vehicle routing-allocation problem: A unifying framework ⋮ A bi-objective uncapacitated facility location problem ⋮ A review of extensive facility location in networks ⋮ Some personal views on the current state and the future of locational analysis ⋮ A multi-modal approach to the location of a rapid transit line ⋮ Infrastructure development for conversion to environmentally friendly fuel ⋮ The maximum covering/shortest path problem: A multiobjective network design and routing formulation ⋮ The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets ⋮ Strategic route extension in transit networks

Cites Work

• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• Multiobjective programming and planning
• Bicriteria Transportation Problem
• Deterministic network optimization: A bibliography
• The Traveling Salesman Problem: A Survey
• The Location of Emergency Service Facilities
• Unnamed Item
• Unnamed Item

This page was built for publication: The maximum covering/shortest path problem: A multiobjective network design and routing formulation