A direct dual method for the mixed plant location problem with some side constraints

DOI10.1007/BF01588244zbMath0416.90052MaRDI QIDQ3206665

Monique Guignard, Kurt Spielberg

Publication date: 1979

Published in: Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

enumerationcomputational resultslinear programming relaxationnumerical experienceorthogonality conditionsdirect dual methodmixed plant location problem

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Mixed integer programming (90C11)

Related Items

Efficient algorithms for the capacitated concentrator location problem, Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems, On the exact solution of large-scale simple plant location problems, The capacitated plant location problem, The design of reverse distribution networks: Models and solution procedures, Simple plant location under uniform delivered pricing, A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution., Approximate solutions to large scale capacitated facility location problems, Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, RAMP algorithms for the capacitated facility location problem, Location and sizing of offshore platforms for oil exploration, A dual ascent approach for steiner tree problems on a directed graph, A dynamic location problem with maximum decreasing capacities, An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies, Capacitated facility location/network design problems., An homage to Joseph-Louis Lagrange and Pierre Huard, Dual ascent: variations of a theme, A heuristic preprocessor supported algorithm for the capacitated plant location problem, Valid inequalities and facets of the capacitated plant location problem, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, An application-oriented guide for designing Lagrangean dual ascent algorithms, The simple plant location problem: Survey and synthesis, Heuristics for the capacitated plant location model, A branch-and-bound algorithm for the multi-level uncapacitated facility location problem, A note on ``A dual-ascent approach to the fixed-charge capacitated network design problem, Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem, A comparison of heuristics and relaxations for the capacitated plant location problem, Facility location with increasing production costs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• Constructive Duality in Integer Programming
• Multicommodity Distribution System Design by Benders Decomposition
• Validation of subgradient optimization
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• A branch‐bound algorithm for the capacitated facilities location problem
• The Traveling-Salesman Problem and Minimum Spanning Trees
• The traveling-salesman problem and minimum spanning trees: Part II
• Canonical Cuts on the Unit Hypercube
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem