A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem

DOI10.1016/j.cor.2016.06.004zbMath1391.90432OpenAlexW2409682755MaRDI QIDQ1652079

Justo Puerto, Diego Ponce, Martine Labbé

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2016.06.004

zbMATH Keywords

ordered median problemMIP formulationsdiscrete multifacility location

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Continuous location (90B85) Discrete location and assignment (90B80)

Related Items

A comparative study of different formulations for the capacitated discrete ordered median problem, An exact completely positive programming formulation for the discrete ordered median problem: an extended version, 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, A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem, The \(p\)-median problem in fuzzy environment: proving fuzzy vertex optimality theorem and its application, A branch-and-price approach for the continuous multifacility monotone ordered median problem

Uses Software

• OR-Library

Cites Work

• Unnamed Item
• On discrete optimization with ordering
• Single-allocation ordered median hub location problems
• A flexible model and efficient solution strategies for discrete location problems
• Distribution systems design with role dependent objectives
• The discrete ordered median problem: Models and solution methods.
• Polyhedral study of simple plant location problem with order
• An extended covering model for flexible discrete and equity location problems
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
• Exact procedures for solving the discrete ordered median problem
• Scheduling two chains of unit jobs on one machine: A polyhedral study
• Location Theory
• Some facets of the simple plant location polytope
• Vertex packings: Structural properties and algorithms
• On the facial structure of set packing polyhedra
• A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment
• A family of facets for the uncapacitated \(p\)-median polytope