The simple plant location problem: Survey and synthesis

DOI10.1016/0377-2217(83)90181-9zbMath0506.90018OpenAlexW2088659184MaRDI QIDQ1837098

Jakob Krarup, Peter Mark Pruzan

Publication date: 1983

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(83)90181-9

zbMATH Keywords

surveyheuristicset packingset coveringpolynomial timelogisticssimple plant location problemexact methodsapproximate algorithmsset partitioningcomputational techniquediscrete, deterministic, single- criterion, NP-hard, optimization problemsp-CENTERp-MEDIAN

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)

Related Items

Optimal and heuristic algorithms for multiproduct uncapacitated facility location, Solving the uncapacited plant location problem on trees, Reason based solutions and the complexity of distribution network design problems, Uncapacitated facility location: General solution procedure and computational experience, On the set partitioning type formulation for the discrete location problem, A new mixed integer linear programming model for the multi level uncapacitated facility location problem, Heuristic algorithms for solving an integrated dynamic center facility location -- network design model, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements, A two-level off-grid electric distribution problem on the continuous space, The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties, A genetic algorithm-based heuristic for the dynamic integrated forward/reverse logistics network for 3PLs, A new multi-criteria scenario-based solution approach for stochastic forward/reverse supply chain network design, Dynamic supply chain design with inventory, Optimizing location of manufacturing industries in the context of economic globalization: a bi-level model based approach, Combination of MCDM and covering techniques in a hierarchical model for facility location: a case study, Models for petroleum field exploitation, Branch-and-bound algorithm for a competitive facility location problem, Formulations for the nonbifurcated hop-constrained multicommodity capacitated fixed-charge network design problem, A distance-limited continuous location-allocation problem for spatial planning of decentralized systems, An integrated model for site selection and space determination of warehouses, Vehicle routing considerations in distribution system design, Efficient primal-dual heuristic for a dynamic location problem, Comparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints, Optimal Physician assignment and patient demand allocation in an outpatient care network, A parallel branch-and-bound algorithm for multicommodity location with balancing requirements, Strategic design of distribution systems with economies of scale in transportation, The optimization of a multi-period multi-product closed-loop supply chain network with cross-docking delivery strategy, On the exact solution of large-scale simple plant location problems, A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables, Solving the robust two-stage capacitated facility location problem with uncertain transportation costs, Revisiting Lagrangian relaxation for network design, Parametric uncapacitated facility location, A voltage drop limited decentralized electric power distribution network, The design of reverse distribution networks: Models and solution procedures, On the complexity of some problems of searching for a family of disjoint clusters, On a class of subadditive duals for the uncapacitated facility location problem, A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution., Discrete facility location with nonlinear diseconomies in fixed costs, Models for multimode multicommodity location problems with interdepot balancing requirements, Solving the bilevel facility location problem under preferences by a Stackelberg-evolutionary algorithm, A facility location model for air pollution detection, On the competitive facility location problem with a free choice of suppliers, Randomized local search for the discrete competitive facility location problem, Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience, Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities, A hierarchical location model for public facility planning, An integrated supply chain problem: a nested Lagrangian relaxation approach, An exact cooperative method for the uncapacitated facility location problem, Threshold robustness in discrete facility location problems: a bi-objective approach, Genetic algorithm for obstacle location-allocation problems with customer priorities, A fuzzy set-theoretic method for public facility location, An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies, Star \(p\)-hub median problem with modular arc capacities, Formulations and relaxations for a multi-echelon capacitated location-distribution problem, A computational study of a nonlinear minsum facility location problem, Star \(p\)-hub center problem and star \(p\)-hub median problem with bounded path lengths, Dual ascent: variations of a theme, Fast bounding procedures for large instances of the simple plant location problem, Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs, Polyhedral results for the precedence-constrained knapsack problem, An application of a Lagrangian-type relaxation for the uncapacitated facility location problem, The dynamic replica placement problem with service levels in content delivery networks: a model and a simulated annealing heuristic, Solving the uncapacitated facility location problem using tabu search, A simple filter-and-fan approach to the facility location problem, Adapting polyhedral properties from facility to hub location problems, Facility location models for distribution system design, Capacitated facility location problem with general setup cost, The double-assignment plant location problem with co-location, A hybrid particle swarm optimization and genetic algorithm for closed-loop supply chain network design in large-scale networks, Facility location with tree topology and radial distance constraints, An improved Lagrangian relaxation and dual ascent approach to facility location problems, An aggressive reduction scheme for the simple plant location problem, Multi-objective competitive location problem with distance-based attractiveness and its best non-dominated solution, A branch-and-bound method for multicommodity location with balancing requirements, Lagrangean heuristics for location problems, Valid inequalities and facets of the capacitated plant location problem, Forecasting return products in an integrated forward/reverse supply chain utilizing an ANFIS, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing, A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem, \(\varepsilon\)-Constraint method for bi-objective competitive facility location problem with uncertain demand scenario, Multi-period lot-sizing with supplier selection: structural results, complexity and algorithms, A separation algorithm for the simple plant location problem, Assessment of approximate algorithms: The error measure's crucial role, A multifactor model for international plant location and financing under uncertainty, Multi-commodity supply network planning in the forest supply chain, Models for the schedule optimization problem at a public transit terminal, A bi-objective uncapacitated facility location problem, A multiperiod two-echelon multicommodity capacitated plant location problem, The dynamic relocation and phase-out of a hybrid two-echelon plant/warehousing facility: A multiple objective approach, The return plant location problem: Modelling and resolution, Separating lifted odd-hole inequalities to solve the index selection problem, A comparison of two dual-based procedures for solving the p-median problem, A simple plant-location model for quantity-setting firms subject to price uncertainty, Location problems, Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem, Facility location with increasing production costs, Multiobjective solution of the uncapacitated plant location problem, An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure, Optimal algorithms for some inverse uncapacitated facility location problems on networks, The maximal dispersion problem and the ``first point outside the neighbourhood heuristic, Multiobjective analysis of facility location decisions, A capacitated competitive facility location problem, Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems, Improved approximation for the capacitated inventory access point problem, Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta, The Performance of greedy algorithms for the on-line steiner tree and related problems, Designing e‐commerce supply chains: a stochastic facility–location approach, An efficient model for the multiple allocation hub maximal covering problem, New variants of the simple plant location problem and applications, Application of facilities location to an insurance company’s office reconfiguration, Siting and sizing of facilities under probabilistic demands, Siting and sizing of facilities under probabilistic demands, Strongly polynomial algorithm for a production-transportation problem with concave production cost, An algorithm for the capacitated, multi-commodity multi-period facility location problem., Solving the simple plant location problem by genetic algorithm, Fuzzy programming and profit and cost allocation for a production and transportation problem, A capacitated facility location problem with constrained backlogging probabilities, Extreme points of discrete location polyhedra, Planning and coordination of production and distribution facilities for multiple commodities, The plant location and flexible technology acquisition problem., An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix, On the Average Case Performance of Some Greedy Approximation Algorithms For the Uncapacitated Facility Location Problem, An integrated model for facility location and technology acquisition, On the use of genetic algorithms to solve location problems, A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM, A Straight Priority-Based Genetic Algorithm for a Logistics Network, Uncapacitated and Capacitated Facility Location Problems, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing, Unnamed Item, Computational complexity of the discrete competitive facility location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A multicriteria approach to the location of public facilities
• Complexity results for scheduling chains on a single machine
• Simple plant location under uniform delivered pricing
• Reducibility of minimax to minisum 0-1 programming problems
• Assessment of approximate algorithms: The error measure's crucial role
• Cores of convex games
• Selected Families of Location Problems
• A direct dual method for the mixed plant location problem with some side constraints
• The p-Median and Its Linear Programming Relaxation: An Approach to Large Problems
• A Dual-Based Procedure for Uncapacitated Facility Location
• Probabilistic Analysis of the Planar k-Median Problem
• Fractional vertices, cuts and facets of the simple plant location problem
• Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
• Worst-Case Analysis of Heuristic Algorithms
• A Dual-Bounded Algorithm for the p-Median Problem
• The Multi-Commodity Facilities Location Problem
• The Lagrangian Relaxation Method for Solving Integer Programming Problems
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Heuristics for the fixed cost median problem
• Some facets of the simple plant location polytope
• A Dual-Based Procedure for Dynamic Facility Location
• Maximising Real-Valued Submodular Functions: Primal and Dual Heuristics for Location Problems
• A Canonical Representation of Simple Plant Location Problems and Its Applications
• A cost function property for plant location problems
• Pseudo-Boolean Solutions to Multidimensional Location Problems
• Comments on the note of Frieze
• Multicommodity Distribution System Design by Benders Decomposition
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• The Simple Plant-Location Problem under Uncertainty
• Set Partitioning: A survey
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Technical Note—An Algorithm for the p-Median Problem
• An analysis of approximations for maximizing submodular set functions—I
• Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane
• Best Algorithms for Approximating the Maximum of a Submodular Set Function
• Covering, Packing and Knapsack Problems
• Approximative Algorithms for Discrete Optimization Problems
• A Survey of Lagrangean Techniques for Discrete Optimization
• Optimal Facility Location with Concave Costs
• Integer Programming: Methods, Uses, Computations
• A Warehouse-Location Problem
• Minimum Concave Cost Flows in Certain Networks
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• Direct Search Algorithms for Zero-One and Mixed-Integer Programming
• A branch‐bound algorithm for the capacitated facilities location problem
• An Additive Algorithm for Solving Linear Programs with Zero-One Variables
• An Analysis of Private and Public Sector Location Models
• Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
• The traveling-salesman problem and minimum spanning trees: Part II
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• On the Set-Covering Problem