An exact completely positive programming formulation for the discrete ordered median problem: an extended version
From MaRDI portal
Publication:2176282
Abstract: This paper presents a first continuous, linear, conic formulation for the Discrete Ordered Median Problem (DOMP). Starting from a binary, quadratic formulation in the original space of location and allocation variables that are common in Location Analysis (L.A.), we prove that there exists a transformation of that formulation, using the same space of variables, that allows us to cast DOMP as a continuous linear problem in the space of completely positive matrices. This is the first positive result that states equivalence between the family of continuous convex problems and some hard problems in L.A. The result is of theoretical interest because it allows us to share the tools from continuous optimization to shed new light into the difficult combinatorial structure of the class of ordered median problems.
Recommendations
- Exact procedures for solving the discrete ordered median problem
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- The discrete ordered median problem: Models and solution methods.
- Continuous multifacility ordered median location problems
- A fresh view on the discrete ordered median problem based on partial monotonicity
Cites work
- scientific article; zbMATH DE number 1859298 (Why is no real title available?)
- scientific article; zbMATH DE number 1417899 (Why is no real title available?)
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- A copositive approach for two-stage adjustable robust optimization with uncertain right-hand sides
- A flexible model and efficient solution strategies for discrete location problems
- A fresh CP look at mixed-binary QPs: new formulations and relaxations
- A gentle, geometric introduction to copositive optimization
- Completely positive reformulations for polynomial optimization
- Copositive optimization -- recent developments and applications
- Distribution systems design with role dependent objectives
- Exact procedures for solving the discrete ordered median problem
- Genetic algorithms for solving the discrete ordered median problem
- Handbook on semidefinite, conic and polynomial optimization
- Location theory. A unified approach
- Multifacility ordered median problems on networks: A further analysis
- On conic QPCCs, conic QCQPs and completely positive programs
- On discrete optimization with ordering
- On the copositive representation of binary and continuous nonconvex quadratic programs
- Quadratic assignment problems
- Representing quadratically constrained quadratic programs as generalized copositive programs
- Revisiting a game theoretic framework for the robust railway network design against intentional attacks
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- Single-allocation ordered median hub location problems
- The ordered capacitated facility location problem
Cited in
(8)- A fresh view on the discrete ordered median problem based on partial monotonicity
- A comparative study of different formulations for the capacitated discrete ordered median problem
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- Discretization and resolution of the \((r| X_ p)\)-medianoid problem involving quality criteria.
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- Constructing a DC decomposition for ordered median problems
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
This page was built for publication: An exact completely positive programming formulation for the discrete ordered median problem: an extended version
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2176282)
