Algorithms for the Simple Plant-Location Problem with Some Side Conditions
From MaRDI portal
Publication:5552010
DOI10.1287/opre.17.1.85zbMath0165.54104OpenAlexW2043943788WikidataQ92384936 ScholiaQ92384936MaRDI QIDQ5552010
Publication date: 1969
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.17.1.85
Related Items
Two algorithms for a plant-storehouse location problem, A direct dual method for the mixed plant location problem with some side constraints, Simple plant location under uniform delivered pricing, A cost operator approach to multistage location-allocation, A search tree algorithm for plant location problems, A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution., Supply chain design considering economies of scale and transport frequencies, A Lagrangean dual ascent algorithm for simple plant location problems, A tree search algorithm for the p-median problem, A projection method for the uncapacitated facility location problem, Modelle und Verfahren zur Bestimmung betrieblicher und innerbetrieblicher Standorte — Ein Überblick, The multidimensional 0-1 knapsack problem: an overview., Dual ascent: variations of a theme, IP over 40+ years at IBM scientific centers and marketing, A heuristic preprocessor supported algorithm for the capacitated plant location problem, Minimum concave-cost network flow problems: Applications, complexity, and algorithms, Integer programming formulation of combinatorial optimization problems, Branch and bound algorithm for the warehouse location problem with the objective function as linear fractional, A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints, The simple plant location problem: Survey and synthesis, Uncapacitated and Capacitated Facility Location Problems, Facility location models for distribution planning, Facility location with increasing production costs, Logical processing for integer programming
