Exact procedures for solving the discrete ordered median problem
From MaRDI portal
Publication:2499160
Recommendations
- The discrete ordered median problem: Models and solution methods.
- 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
- scientific article; zbMATH DE number 1859298
- A flexible model and efficient solution strategies for discrete location problems
Cites work
- A flexible approach to location problems
- Aggregation Error Bounds for a Class of Location Models
- An algorithm for the quadratic assignment problem using Benders' decomposition
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- An outer approximate subdifferential method for piecewise affine optimization
- Capacitated facility location: Separation algorithms and computational experience
- Geometrical properties of the symmetrical single facility location problem
- Heuristic procedures for solving the discrete ordered median problem
- scientific article; zbMATH DE number 1594573 (Why is no real title available?)
- scientific article; zbMATH DE number 44281 (Why is no real title available?)
- scientific article; zbMATH DE number 1746287 (Why is no real title available?)
- scientific article; zbMATH DE number 1859298 (Why is no real title available?)
- scientific article; zbMATH DE number 821272 (Why is no real title available?)
- scientific article; zbMATH DE number 1394671 (Why is no real title available?)
- HubLocator: An exact solution method for the multiple allocation hub location problem
- Solution algorithms for the capacitated single allocation hub location problem
- The capacitated multiple allocation hub location problem: Formulations and algorithms
- The discrete ordered median problem: Models and solution methods.
- The quadratic assignment problem
Cited in
(48)- Convex ordered median problem with \(\ell _p\)-norms
- A flexible model and efficient solution strategies for discrete location problems
- Constructing a DC decomposition for ordered median problems
- Distribution systems design with role dependent objectives
- New results on the computation of median orders
- The discrete ordered median problem: Models and solution methods.
- A revised variable neighborhood search for the discrete ordered median problem
- A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
- Copositivity and complete positivity. Abstracts from the workshop held October 29 -- Novermber 4, 2017
- Ordered weighted average optimization in multiobjective spanning tree problem
- The fair OWA one-to-one assignment problem: NP-hardness and polynomial time special cases
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems
- A branch-and-price approach for the continuous multifacility monotone ordered median problem
- 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
- Alternative formulations for the obnoxious \(p\)-median problem
- A modified variable neighborhood search for the discrete ordered median problem
- The ordered \(k\)-median problem: surrogate models and approximation algorithms
- Solving the ordered one-median problem in the plane
- 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
- The \(p\)-facility ordered median problem on networks
- Ordered median problem with demand distribution weights
- 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
- Continuous multifacility ordered median location problems
- A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
- A flexible model and efficient solution strategies for discrete location problems
- On discrete optimization with ordering
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms
- scientific article; zbMATH DE number 1859298 (Why is no real title available?)
- A parallelized lagrangean relaxation approach for the discrete ordered median problem
- A new formulation of the capacitated discrete ordered median problems with \(\{0,1\}\)-assignment
- Constraint relaxation for the discrete ordered median problem
- The ordered capacitated facility location problem
- On solving the planar k-centrum problem with Euclidean distances
- SDP-based Benders decomposition for solving p-median quadratic facility location problems
- The ordered median tree location problem
- Benders decomposition for the discrete ordered median problem
- Single-allocation ordered median hub location problems
- Ordered median traveling salesman problem
- Optimization-based computation and integration of ordered measures
- On the exponential cardinality of FDS for the ordered p-median problem
- Heuristic procedures for solving the discrete ordered median problem
- Genetic algorithms for solving the discrete ordered median problem
- Extensions to the continuous ordered median problem
This page was built for publication: Exact procedures for solving the discrete ordered median problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2499160)
