The ordered capacitated facility location problem
From MaRDI portal
Publication:611009
DOI10.1007/s11750-009-0089-0zbMath1201.90118OpenAlexW2072034470WikidataQ58217223 ScholiaQ58217223MaRDI QIDQ611009
Justo Puerto, Antonio M. Rodríguez-Chía, Jörg Kalcsics, Stefan Nickel
Publication date: 13 December 2010
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-009-0089-0
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (21)
Exact algorithms for handling outliers in center location problems on networks using \(k\)-max functions ⋮ The maximin HAZMAT routing problem ⋮ Capacitated \(p\)-center problem with failure foresight ⋮ Continuous multifacility ordered median location problems ⋮ On discrete optimization with ordering ⋮ A comparative study of different formulations for the capacitated discrete ordered median problem ⋮ An exact completely positive programming formulation for the discrete ordered median problem: an extended version ⋮ On solving the planar \(k\)-centrum problem with Euclidean distances ⋮ Ordered \(p\)-median problems with neighbourhoods ⋮ Identifying trade‐offs in equity and efficiency for simultaneously optimizing location and multipriority dispatch of ambulances ⋮ A fresh view on the discrete ordered median problem based on partial monotonicity ⋮ Constraint relaxation for the discrete ordered median problem ⋮ The discrete facility location problem with balanced allocation of customers ⋮ Closest assignment constraints in discrete location problems ⋮ A specialized branch \& bound \& cut for single-allocation ordered median hub location problems ⋮ Preprocessing for a map sectorization problem by means of mathematical programming ⋮ A modified variable neighborhood search for the discrete ordered median problem ⋮ Single-allocation ordered median hub location problems ⋮ Range minimization problems in path-facility location on trees ⋮ Distribution systems design with role dependent objectives ⋮ Alternative formulations for the ordered weighted averaging objective
Cites Work
- On the exponential cardinality of FDS for the ordered \(p\)-median problem
- Heuristic procedures for solving the discrete ordered median problem
- Genetic algorithms for solving the discrete ordered median problem
- An extension to rapid transit network design problem
- On the convergence of the Weiszfeld algorithm for continuous single facility location-allocation problems
- Improved algorithms for the multicut and multiflow problems in rooted trees
- A flexible model and efficient solution strategies for discrete location problems
- On solving linear programs with the ordered weighted averaging objective.
- Minimizing the sum of the \(k\) largest functions in linear time.
- Algorithmic results for ordered median problems
- A flexible approach to location problems
- Exact procedures for solving the discrete ordered median problem
- Multicriteria planar ordered median problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A New Formulation and Resolution Method for the p-Center Problem
- Location Theory
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Multifacility ordered median problems on networks: A further analysis
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: The ordered capacitated facility location problem
