A parallelized lagrangean relaxation approach for the discrete ordered median problem

DOI10.1007/s10479-014-1744-xzbMath1357.90077OpenAlexW2009123537MaRDI QIDQ512991

Juana L. Redondo, Alfredo Marín, Pilar M. Ortigosa

Publication date: 3 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-014-1744-x

zbMATH Keywords

integer programmingLagrangean relaxationdiscrete location

Mathematics Subject Classification ID

Integer programming (90C10) Discrete location and assignment (90B80)

Related Items

Discrete facility location in machine learning, Parallel computational optimization in operations research: a new integrative framework, literature review and research directions, Near-optimal large-scale k-medoids clustering

Uses Software

• OR-Library
• SITATION
• MOD-DIST
• MENU-OKF

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Comparative error bound theory for three location models: continuous demand versus discrete demand
• A flexible model and efficient solution strategies for discrete location problems
• Lagrangean relaxation. (With comments and rejoinder).
• A modified variable neighborhood search for the discrete ordered median problem
• An extended covering model for flexible discrete and equity location problems
• Exact procedures for solving the discrete ordered median problem
• Location Theory
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Robust mean absolute deviation problems on networks with linear vertex weights
• Optimum Distribution of Switching Centers in a Communication Network and Some Related Graph Theoretic Problems
• Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph