A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment

DOI10.1007/978-3-540-77903-2_26zbMath1209.90232OpenAlexW1513665763MaRDI QIDQ5391897

Justo Puerto

Publication date: 7 April 2011

Published in: Operations Research Proceedings (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77903-2_26

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (8)

A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem ⋮ On discrete optimization with ordering ⋮ 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 ⋮ Ordered weighted average optimization in multiobjective spanning tree problem ⋮ A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem

Cites Work

• Minimizing the sum of the \(k\) largest functions in linear time.
• Exact procedures for solving the discrete ordered median problem
• Location Theory
• Unnamed Item

This page was built for publication: A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment