A direct dual method for the mixed plant location problem with some side constraints
From MaRDI portal
Publication:3206665
Cites work
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3550467 (Why is no real title available?)
- scientific article; zbMATH DE number 3559283 (Why is no real title available?)
- scientific article; zbMATH DE number 3568354 (Why is no real title available?)
- scientific article; zbMATH DE number 3573593 (Why is no real title available?)
- scientific article; zbMATH DE number 3614502 (Why is no real title available?)
- scientific article; zbMATH DE number 3323527 (Why is no real title available?)
- scientific article; zbMATH DE number 3400670 (Why is no real title available?)
- A Dual-Based Procedure for Uncapacitated Facility Location
- 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
- Canonical Cuts on the Unit Hypercube
- Constructive Duality in Integer Programming
- Direct Search Algorithms for Zero-One and Mixed-Integer Programming
- Multicommodity Distribution System Design by Benders Decomposition
- The Traveling-Salesman Problem and Minimum Spanning Trees
- The traveling-salesman problem and minimum spanning trees: Part II
- Validation of subgradient optimization
Cited in
(28)- Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems
- A dynamic location problem with maximum decreasing capacities
- An homage to Joseph-Louis Lagrange and Pierre Huard
- Dual ascent: variations of a theme
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- A dual ascent approach for steiner tree problems on a directed graph
- 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 comparison of heuristics and relaxations for the capacitated plant location problem
- A heuristic preprocessor supported algorithm 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
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)
