A comparative study of different formulations for the capacitated discrete ordered median problem
From MaRDI portal
Publication:2664433
Recommendations
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- A new formulation of the capacitated discrete ordered median problems with \(\{0,1\}\)-assignment
- The ordered capacitated facility location problem
- The discrete ordered median problem: Models and solution methods.
- Discrete equal-capacityp-median problem
Cites work
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- A flexible model and efficient solution strategies for discrete location problems
- A mixed integer linear model for clustering with variable selection
- A new formulation and resolution method for the p-center problem
- A new formulation of the capacitated discrete ordered median problems with \(\{0,1\}\)-assignment
- A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
- A tighter formulation of the p-median problem
- An exact completely positive programming formulation for the discrete ordered median problem: an extended version
- An extended covering model for flexible discrete and equity location problems
- Distribution systems design with role dependent objectives
- Double bound method for solving the p-center location problem
- Efficient algorithms for the uncapacitated single allocation p-hub median problem
- Exact procedures for solving the discrete ordered median problem
- Finding the nucleolus of any n-person cooperative game by a single linear program
- Geometrical properties of the symmetrical single facility location problem
- scientific article; zbMATH DE number 1859298 (Why is no real title available?)
- scientific article; zbMATH DE number 1394671 (Why is no real title available?)
- Location theory. A unified approach
- Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem
- Minimax regret single-facility ordered median location problems on networks
- On discrete optimization with ordering
- On the exponential cardinality of FDS for the ordered p-median problem
- Ordered weighted average combinatorial optimization: formulations and their properties
- Ordered weighted average optimization in multiobjective spanning tree problem
- Single-allocation ordered median hub location problems
- Solution algorithms for the capacitated single allocation hub location problem
- Solving large p-median problems with a radius formulation
- The ordered capacitated facility location problem
- The stratified p-center problem
Cited in
(8)- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- A matheuristic for large-scale capacitated clustering
- Segmentation of scanning-transmission electron microscopy images using the ordered median problem
- A new formulation of the capacitated discrete ordered median problems with \(\{0,1\}\)-assignment
- The ordered capacitated facility location problem
- Formulations and valid inequalities for the capacitated dispersion problem
- Revisiting a Cornuéjols-Nemhauser-Wolsey formulation for the \(\mathrm{p}\)-median problem
This page was built for publication: A comparative study of different formulations for the capacitated discrete ordered median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2664433)
