scientific article; zbMATH DE number 1149858

MaRDI QIDQ4387250zbMATHFDO

Authors Brian Boffey, Subhash C. Narula

Publication date 7 May 1998

zbMATH Keywords

facility locationroutingcovermaximal covering location problemmaximal covering shortest path problempoint location covering problems

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• Models for multi-path covering problems
• scientific article; zbMATH DE number 1253041
• scientific article; zbMATH DE number 4051316
• The median tour and maximal covering tour problems: Formulations and heuristics

Cited in

(11)

• The median tour and maximal covering tour problems: Formulations and heuristics
• Spatial coverage in routing and path planning problems
• The maximum covering/shortest path problem: A multiobjective network design and routing formulation
• A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
• Robust multiobjective optimization with application to Internet routing
• Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study
• A review of congestion models in the location of facilities with immobile servers
• The multi-vehicle cumulative covering tour problem
• Dual-based heuristics for a hierarchical covering location problem
• A location-routing problem in glass recycling
• Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution

This page was built for publication:

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