Algorithms for the Simple Plant-Location Problem with Some Side Conditions

Cited In (24)

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

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)