A flexible model and efficient solution strategies for discrete location problems
From MaRDI portal
Publication:1028444
DOI10.1016/j.dam.2008.03.013zbMath1163.90609OpenAlexW2063087503WikidataQ58217227 ScholiaQ58217227MaRDI QIDQ1028444
Justo Puerto, Stefan Nickel, Sebastian Velten, Alfredo Marín
Publication date: 30 June 2009
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://idus.us.es/xmlui/handle/11441/47313
Related Items
A revised variable neighborhood search for the discrete ordered median problem, An extended covering model for flexible discrete and equity location problems, Continuous multifacility ordered median location problems, Location of Emergency Facilities with Uncertainty in the Demands, Looking for edge-equitable spanning trees, When centers can fail: a close second opportunity, A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem, Locating hyperplanes to fitting set of points: a general framework, On discrete optimization with ordering, Lexicographical order in integer programming, Solving the \(p\)-median problem on regular and lattice networks, 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, The ordered capacitated facility location problem, Segmentation of scanning-transmission electron microscopy images using the ordered median problem, On solving the planar \(k\)-centrum problem with Euclidean distances, The probabilistic \(p\)-center problem: planning service for potential customers, Ordered \(p\)-median problems with neighbourhoods, A fresh view on the discrete ordered median problem based on partial monotonicity, Constraint relaxation for the discrete ordered median problem, Dynamically second-preferred \(p\)-center problem, Formulations and valid inequalities for the capacitated dispersion problem, Optimization problems with flexible objectives: a general modeling approach and applications, The discrete facility location problem with balanced allocation of customers, A specialized branch \& bound \& cut for single-allocation ordered median hub location problems, Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms, Alternative formulations for the obnoxious \(p\)-median problem, Ordered weighted average combinatorial optimization: formulations and their properties, An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation, Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017, Continuous location under the effect of `refraction', A parallelized lagrangean relaxation approach for the discrete ordered median problem, Balancing the arrival times of users in a two-stage location problem, The geometry of optimal partitions in location problems, Ordered weighted average optimization in multiobjective spanning tree problem, On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem, A modified variable neighborhood search for the discrete ordered median problem, The stratified \(p\)-center problem, Exact algorithms for OWA-optimization in multiobjective spanning tree problems, Single-allocation ordered median hub location problems, A comparison of formulations and solution methods for the minimum-envy location problem, Convex ordered median problem with \(\ell _p\)-norms, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, Optimal shrinking of the distribution chain: the facilities delocation decision, Distribution systems design with role dependent objectives, A branch-and-price approach for the continuous multifacility monotone ordered median problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Heuristic procedures for solving the discrete ordered median problem
- Lower bounds for the two-stage uncapacitated facility location problem
- Capacitated facility location: Separation algorithms and computational experience
- Variable neighborhood search
- The discrete ordered median problem: Models and solution methods.
- Solving covering problems and the uncapacitated plant location problem on trees
- On the facets of the simple plant location packing polytope
- Minimizing the sum of the \(k\) largest functions in linear time.
- A flexible approach to location problems
- Exact procedures for solving the discrete ordered median problem
- Dynamic multi-commodity capacitated facility location: a mathematical modeling framework for strategic supply chain planning
- A strengthened formulation for the simple plant location problem with order
- A New Formulation and Resolution Method for the p-Center Problem
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- A Canonical Representation of Simple Plant Location Problems and Its Applications
- Aggregation Error Bounds for a Class of Location Models
