Constraint relaxation for the discrete ordered median problem

DOI10.1007/s11750-022-00651-3OpenAlexW4311832165MaRDI QIDQ6081610

Diego Ponce, Justo Puerto, Luisa I. Martínez-Merino

Publication date: 26 October 2023

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11750-022-00651-3

zbMATH Keywords

branch-and-cutrow generationdiscrete ordered median problemconstraint relaxation

Mathematics Subject Classification ID

Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)

Cites Work

• Unnamed Item
• Unnamed Item
• Applying oracles of on-demand accuracy in two-stage stochastic programming -- a computational study
• A branch-and-cut algorithm for the orienteering arc routing problem
• Level bundle methods for constrained convex optimization with various oracles
• The ordered capacitated facility location problem
• SCIP: solving constraint integer programs
• A comparison of formulations and solution methods for the minimum-envy location problem
• A flexible model and efficient solution strategies for discrete location problems
• Embedding relaxations in global constraints for solving TSP and TSPTW
• 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
• The probabilistic \(p\)-center problem: planning service for potential customers
• Ordered weighted average optimization in multiobjective spanning tree problem
• Clustering data that are graph connected
• Optimization-oriented global constraints
• Benders decomposition with adaptive oracles for large scale optimization
• A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes
• The ordered \(k\)-median problem: surrogate models and approximation algorithms
• 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
• Segmentation of scanning-transmission electron microscopy images using the ordered median problem
• Solving TSP through the Integration of OR and CP Techniques
• Level bundle methods for oracles with on-demand accuracy
• On Minimizing Ordered Weighted Regrets in Multiobjective Markov Decision Processes
• Location Theory
• A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem
• Solving matching problems with linear programming
• Matching, Euler tours and the Chinese postman
• Integer Programming and Combinatorial Optimization
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph
• The \(k\)-centrum multi-facility location problem

This page was built for publication: Constraint relaxation for the discrete ordered median problem