A comparative study of different formulations for the capacitated discrete ordered median problem

DOI10.1016/j.cor.2020.105067zbMath1458.90429OpenAlexW3047565606MaRDI QIDQ2664433

Justo Puerto, Antonio M. Rodríguez-Chía, Inmaculada Espejo

Publication date: 20 April 2021

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

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

zbMATH Keywords

discrete locationcapacitated location problemordered median location problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Related Items (3)

A matheuristic for large-scale capacitated clustering ⋮ Segmentation of scanning-transmission electron microscopy images using the ordered median problem ⋮ A branch-and-price approach for the continuous multifacility monotone ordered median problem

Uses Software

• OR-Library
• AP-library

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding the nucleolus of any \(n\)-person cooperative game by a single linear program
• Double bound method for solving the \(p\)-center location problem
• A mixed integer linear model for clustering with variable selection
• On discrete optimization with ordering
• The ordered capacitated facility location problem
• Single-allocation ordered median hub location problems
• On the exponential cardinality of FDS for the ordered \(p\)-median problem
• A flexible model and efficient solution strategies for discrete location problems
• Distribution systems design with role dependent objectives
• Solution algorithms for the capacitated single allocation hub location problem
• Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem
• A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
• Ordered weighted average optimization in multiobjective spanning tree problem
• The stratified \(p\)-center problem
• An exact completely positive programming formulation for the discrete ordered median problem: an extended version
• A tighter formulation of the \(p\)-median problem
• An extended covering model for flexible discrete and equity location problems
• A specialized branch \& bound \& cut for single-allocation ordered median hub location problems
• Ordered weighted average combinatorial optimization: formulations and their properties
• Exact procedures for solving the discrete ordered median problem
• A New Formulation and Resolution Method for the p-Center Problem
• Solving Large p-Median Problems with a Radius Formulation
• Minimax Regret Single-Facility Ordered Median Location Problems on Networks
• Location Theory
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
• Efficient algorithms for the uncapacitated single allocation p-hub median problem
• A New Formulation of the Capacitated Discrete Ordered Median Problems with {0, 1}-Assignment

This page was built for publication: A comparative study of different formulations for the capacitated discrete ordered median problem