A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
From MaRDI portal
Publication:3386785
DOI10.1287/ijoc.2019.0915zbMath1451.90085arXiv1802.03191OpenAlexW2937321088WikidataQ126398684 ScholiaQ126398684MaRDI QIDQ3386785
Diego Ponce, Martine Labbé, Samuel Deleplanque, Justo Puerto
Publication date: 7 January 2021
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1802.03191
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items (8)
A comparative study of different formulations for the capacitated discrete ordered median problem ⋮ Segmentation of scanning-transmission electron microscopy images using the ordered median problem ⋮ 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 ⋮ Alternative formulations for the obnoxious \(p\)-median problem ⋮ A branch-and-price procedure for clustering data that are graph connected ⋮ 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
- Finding the nucleolus of any \(n\)-person cooperative game by a single linear program
- On discrete optimization with ordering
- Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems
- Single-allocation ordered median hub location problems
- Heuristic procedures for solving the discrete ordered median problem
- Computational study of large-scale \(p\)-median problems
- Genetic algorithms for solving the discrete ordered median problem
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A flexible model and efficient solution strategies for discrete location problems
- A probabilistic heuristic for a computationally difficult set covering problem
- Stabilized column generation
- A column generation approach to capacitated \(p\)-median problems
- 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
- Ordered weighted average optimization in multiobjective spanning tree problem
- A branch-and-price approach to \(p\)-median location problems
- Greedy randomized adaptive search procedures
- Branching rules revisited
- A modified variable neighborhood search for the discrete ordered median problem
- An extended covering model for flexible discrete and equity location problems
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- Ordered weighted average combinatorial optimization: formulations and their properties
- Exact procedures for solving the discrete ordered median problem
- Branch-and-Price: Column Generation for Solving Huge Integer Programs
- A Constraint-Programming-Based Branch-and-Price-and-Cut Approach for Operating Room Planning and Scheduling
- Branch and Price for Large-Scale Capacitated Hub Location Problems with Single Assignment
- Minimax Regret Single-Facility Ordered Median Location Problems on Networks
- A Branch-and-Price Algorithm and New Test Problems for Spectrum Auctions
- A branch‐and‐price algorithm for the capacitated p‐median problem
- A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment
- A Primer in Column Generation
- Experiments in mixed-integer linear programming
This page was built for publication: A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
