Multicriteria network location problems with sum objectives

DOI<79::AID-NET1>3.0.CO;2-L 10.1002/(SICI)1097-0037(199903)33:2<79::AID-NET1>3.0.CO;2-LzbMath0918.90097OpenAlexW1988569966MaRDI QIDQ4242779

Horst W. Hamacher, Martine Labbé, Stefan Nickel

Publication date: 4 August 1999

Full work available at URL: https://doi.org/10.1002/(sici)1097-0037(199903)33:2<79::aid-net1>3.0.co;2-l

zbMATH Keywords

network locationmulticriteria problemsseveral objectivesGoldman's dominance algorithmPareto locations

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Discrete location and assignment (90B80)

Related Items (16)

A bi-objective approach to discrete cost-bottleneck location problems ⋮ Bicriteria network location (BNL) problems with criteria dependent lengths and minisum objectives ⋮ Unnamed Item ⋮ Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study ⋮ A polynomial algorithm for the multicriteria cent-dian location problem ⋮ Computation of ideal and Nadir values and implications for their use in MCDM methods. ⋮ Extensions of dynamic programming for multi-stage combinatorial optimization ⋮ A note on the minmax regret centdian location on trees ⋮ Unnamed Item ⋮ The multicriteria \(p\)-facility median location problem on networks ⋮ Hub-and-spoke network design with congestion ⋮ Effectiveness-equity models for facility location problems on tree networks ⋮ An algorithm for solving the bi-objective median path-shaped facility on a tree network ⋮ Geometric methods to solve max-ordering location problems ⋮ Multicriteria planar ordered median problems ⋮ Multiobjective solution of the uncapacitated plant location problem

This page was built for publication: Multicriteria network location problems with sum objectives