A projection method for the uncapacitated facility location problem

DOI10.1007/BF01585746zbMath0705.90050OpenAlexW1996112802MaRDI QIDQ918404

Cornuéjols, Gérard, Andrew R. Conn

Publication date: 1990

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01585746

zbMATH Keywords

relaxationprojection methodcutting plane methodsuncapacitated facility location

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Continuous location (90B85) Linear programming (90C05) Boolean programming (90C09) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items

A projection method for \(l_ p\) norm location-allocation problems ⋮ A hybrid multistart heuristic for the uncapacitated facility location problem ⋮ A mixed integer nonlinear programming model and heuristic solutions for location, inventory and pricing decisions in a closed loop supply chain ⋮ Location and layout planning. A survey ⋮ Discontinuous piecewise linear optimization ⋮ A conjugate Rosen's gradient projection method with global line search for piecewise linear concave optimization ⋮ Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta ⋮ Semi-Lagrangian relaxation applied to the uncapacitated facility location problem ⋮ An exact cooperative method for the uncapacitated facility location problem ⋮ Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem ⋮ Fast bounding procedures for large instances of the simple plant location problem ⋮ Solving the simple plant location problem by genetic algorithm ⋮ A simple tabu search for warehouse location ⋮ An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem ⋮ The plant location problem with demand-dependent setup costs and centralized allocation ⋮ L-Broyden methods: a generalization of the L-BFGS method to the limited-memory Broyden family ⋮ A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem ⋮ The radar method: An effective line search for piecewise linear concave functions ⋮ A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem ⋮ Separating lifted odd-hole inequalities to solve the index selection problem

Cites Work

• Cluster Analysis: An Application of Lagrangian Relaxation
• On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
• A projected newton method forl p norm location problems
• Probabilistic Analysis of a Relaxation for the k-Median Problem
• A Dual-Based Procedure for Uncapacitated Facility Location
• Fractional vertices, cuts and facets of the simple plant location problem
• Some facets of the simple plant location polytope
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• A man-machine approach toward solving the traveling salesman problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item