Algorithms for the Simple Plant-Location Problem with Some Side Conditions
From MaRDI portal
Cited in
(24)- Facility location models for distribution planning
- Simple plant location under uniform delivered pricing
- A cost operator approach to multistage location-allocation
- A search tree algorithm for plant location problems
- A tree search algorithm for the p-median problem
- Integer programming formulation of combinatorial optimization problems
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- The multidimensional 0-1 knapsack problem: an overview.
- The simple plant location problem: Survey and synthesis
- Facility location with increasing production costs
- A heuristic preprocessor supported algorithm for the capacitated plant location problem
- Minimum concave-cost network flow problems: Applications, complexity, and algorithms
- A direct dual method for the mixed plant location problem with some side constraints
- Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick
- Supply chain design considering economies of scale and transport frequencies
- Dual ascent: variations of a theme
- IP over 40+ years at IBM scientific centers and marketing
- Uncapacitated and capacitated facility location problems
- Two algorithms for a plant-storehouse location problem
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
- Logical processing for integer programming
- A Lagrangean dual ascent algorithm for simple plant location problems
- A projection method for the uncapacitated facility location problem
- Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional
This page was built for publication: Algorithms for the Simple Plant-Location Problem with Some Side Conditions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5552010)
