A branch-and-price approach for the continuous multifacility monotone ordered median problem
From MaRDI portal
Publication:2106721
DOI10.1016/j.ejor.2022.07.020OpenAlexW3188393289MaRDI QIDQ2106721
Ricardo Gázquez, Justo Puerto, Diego Ponce, Víctor Blanco
Publication date: 19 December 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2108.00407
combinatorial optimizationcontinuous locationbranch-and-pricemixed integer nonlinear programmingordered median problems
Mixed integer programming (90C11) Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Continuous multifacility ordered median location problems
- Accelerating convergence in minisum location problem with \(\ell p\) norms
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Continuous location under the effect of `refraction'
- New local searches for solving the multi-source Weber problem
- On the structure of the solution set for the single facility location problem with average distances
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Complexity evaluation of benchmark instances for the \(p\)-median problem
- Decomposition-based heuristic for the zoning and crop planning problem with adjacency constraints
- Computational study of large-scale \(p\)-median problems
- Aggregation effects in maximum covering models
- A branch-and-price algorithm for the multi-source Weber problem
- A comparison of formulations and solution methods for the minimum-envy location problem
- A flexible model and efficient solution strategies for discrete location problems
- Constructing a DC decomposition for ordered median problems
- A note on solving large p-median problems
- Optimization of a 532-city symmetric traveling salesman problem by branch and cut
- An optimal method for solving the (generalized) multi-Weber problem
- Heuristic solution of the multisource Weber problem as a \(p\)-median problem
- The Weber problem with regional demand
- Stabilized column generation
- A cellular heuristic for the multisource Weber problem.
- Upgrading nodes in tree-shaped hub location
- A revised variable neighborhood search for the discrete ordered median problem
- Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem
- 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
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- Locating tree-shaped facilities using the ordered median objective
- Open questions concerning Weiszfeld's algorithm for the Fermat-Weber location problem
- A note on greedy algorithms for the maximum weighted independent set problem
- The Fermat-Weber location problem revisited
- On the multisource hyperplanes location problem to fitting set of points
- A branch-and-price procedure for clustering data that are graph connected
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- A fresh view on the discrete ordered median problem based on partial monotonicity
- A new local search for continuous location problems
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- On location-allocation problems for dimensional facilities
- An extended covering model for flexible discrete and equity location problems
- Ordered \(p\)-median problems with neighbourhoods
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Ordered weighted average combinatorial optimization: formulations and their properties
- A comparative study of different formulations for the capacitated discrete ordered median problem
- Continuous maximal covering location problems with interconnected facilities
- Segmentation of scanning-transmission electron microscopy images using the ordered median problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A New Formulation and Resolution Method for the p-Center Problem
- Solving Large p-Median Problems with a Radius Formulation
- On Minimizing Ordered Weighted Regrets in Multiobjective Markov Decision Processes
- Location Theory
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Using Block Norms for Location Modeling
- NP-Hard, Capacitated, Balanced p-Median Problems on a Chain Graph with a Continuum of Link Demands
- Location-Allocation Problems
- TSPLIB—A Traveling Salesman Problem Library
- Objective function approximations in mathematical programming
- The generalized Weber problem with expected distances
- A historical perspective on location problems
- Location Science
- On the Continuous Fermat-Weber Problem
- A Primer in Column Generation
- An Approach to Location Models Involving Sets as Existing Facilities
- The \(k\)-centrum multi-facility location problem
