Solving the p-median problem with a semi-Lagrangian relaxation

DOI10.1007/S10589-006-6513-6zbMATH Open1151.90521OpenAlexW2008919321MaRDI QIDQ853887FDOQ853887

Authors: C. Tadonki, C. 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

Recommendations

• The omnipresence of Lagrange
• scientific article; zbMATH DE number 1253042
• Semidefinite and Lagrangian relaxations for hard combinatorial problems
• scientific article; zbMATH DE number 2084780
• Lagrangean relaxation. (With comments and rejoinder).

zbMATH Keywords

combinatorial optimizationLagrangian relaxation

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (25)

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

Uses Software

• Matlab
• TSPLIB
• CPLEX
• MEX-file

This page was built for publication: Solving the \(p\)-median problem with a semi-Lagrangian relaxation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q853887)