Solving the \(p\)-median problem with a semi-Lagrangian relaxation

DOI10.1007/s10589-006-6513-6zbMath1151.90521OpenAlexW2008919321MaRDI QIDQ853887

C. Tadonki, Cesar Beltran-Royo, Jean-Philippe Vial

Publication date: 17 November 2006

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-006-6513-6

zbMATH Keywords

Lagrangian relaxationcombinatorial optimization

Mathematics Subject Classification ID

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

Related Items

The \(p\)-median problem: a survey of metaheuristic approaches, Uncontrolled inexact information within bundle methods, K-medoids inverse regression, A Lagrangian search method for the \(P\)-median problem, The most probable allocation solution for the p-median problem, Discrete facility location in machine learning, Matheuristics: survey and synthesis, Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce, Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems, On a class of subadditive duals for the uncapacitated facility location problem, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, The spherical constraint in Boolean quadratic programs, An exact cooperative method for the uncapacitated facility location problem, Optimal partitioning of a data set based on the \(p\)-median model, An aggregation heuristic for large scale p-median problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, A tighter formulation of the \(p\)-median problem, Semi-Lagrangean approach for price discovery in markets with non-convexities, An improved Lagrangian relaxation and dual ascent approach to facility location problems, Affinity propagation and uncapacitated facility location problems, Critical Review of Pricing Schemes in Markets with Non-Convex Costs, A computational evaluation of a general branch-and-price framework for capacitated network location problems, Exemplar-based clustering via simulated annealing

Uses Software

• Matlab
• TSPLIB
• CPLEX
• MEX-file

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cluster analysis and mathematical programming
• A practical algorithm for computing a subadditive dual function for set partitioning
• Variable neighborhood decomposition search
• Cluster Analysis: An Application of Lagrangian Relaxation
• The Cutting-Plane Method for Solving Convex Programs
• Lagrangean decomposition: A model yielding stronger lagrangean bounds
• Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
• An Algorithmic Approach to Network Location Problems. II: Thep-Medians
• Decomposition and Nondifferentiable Optimization with the Projective Algorithm
• TSPLIB—A Traveling Salesman Problem Library
• The Optimal Diversity Management Problem
• On the \(p\)-median polytope
• A geometric study of dual gaps, with applications
• A family of facets for the uncapacitated \(p\)-median polytope