A Primal Approach to the Simple Plant Location Problem

DOI10.1137/0603051zbMath0494.90022OpenAlexW1997604536MaRDI QIDQ3958238

Jean-Michel Thizy, Cornuéjols, Gérard

Publication date: 1982

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0603051

zbMATH Keywords

heuristiccomputational experiencelogisticsstrong linear programming relaxationprimal approachgreedy-interchange algorithmprimal subgradient algorithmsimple plant location problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Nonlinear programming (90C30) Linear programming (90C05) Inventory, storage, reservoirs (90B05)

Related Items

The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, The plant location problem with demand-dependent setup costs and centralized allocation, A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, An ex-post bound on the greedy heuristic for the uncapacitated facility location problem, Plant location with minimum inventory, Separating lifted odd-hole inequalities to solve the index selection problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Algorithms for some minimax problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• 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
• Validation of subgradient optimization
• A man-machine approach toward solving the traveling salesman problem