Solving the p-median problem with a semi-Lagrangian relaxation
From MaRDI portal
Publication:853887
Recommendations
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 2086935 (Why is no real title available?)
- A family of facets for the uncapacitated \(p\)-median polytope
- A geometric study of dual gaps, with applications
- A practical algorithm for computing a subadditive dual function for set partitioning
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Cluster Analysis: An Application of Lagrangian Relaxation
- Cluster analysis and mathematical programming
- Decomposition and Nondifferentiable Optimization with the Projective Algorithm
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- On the \(p\)-median polytope
- TSPLIB—A Traveling Salesman Problem Library
- The Cutting-Plane Method for Solving Convex Programs
- The Optimal Diversity Management Problem
- Variable neighborhood decomposition search
Cited in
(26)- A simple stabilizing method for column generation heuristics: an application to \(p\)-median location problems
- An exact cooperative method for the uncapacitated facility location problem
- Uncontrolled inexact information within bundle methods
- Affinity propagation and uncapacitated facility location problems
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- A feasibility-ensured Lagrangian heuristic for general decomposable problems
- An aggregation heuristic for large scale p-median problem
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- The \(p\)-median problem: a survey of metaheuristic approaches
- Semi-Lagrangean approach for price discovery in markets with non-convexities
- On a class of subadditive duals for the uncapacitated facility location problem
- Combining penalty‐based and Gauss–Seidel methods for solving stochastic mixed‐integer problems
- A Lagrangian search method for the \(P\)-median problem
- An improved Lagrangian relaxation and dual ascent approach to facility location problems
- Survey on Lagrangian Relaxation for MILP: Importance, Challenges, Historical Review, Recent Advancements, and Opportunities
- The spherical constraint in Boolean quadratic programs
- Exemplar-based clustering via simulated annealing
- Matheuristics: survey and synthesis
- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- Optimal partitioning of a data set based on the \(p\)-median model
- Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce
- Discrete facility location in machine learning
- The most probable allocation solution for the \(p\)-median problem
- A tighter formulation of the \(p\)-median problem
- K-medoids inverse regression
- Critical review of pricing schemes in markets with non-convex costs
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)
