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

DOI10.1007/BF01588244zbMATH Open0416.90052MaRDI QIDQ3206665FDOQ3206665

Authors: Monique Guignard, Kurt Spielberg 

Publication date: 1979

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

zbMATH Keywords

orthogonality conditionsenumerationcomputational resultslinear programming relaxationnumerical experiencedirect dual methodmixed plant location problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (28)

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

This page was built for publication: A direct dual method for the mixed plant location problem with some side constraints

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