On the exact solution of large-scale simple plant location problems

DOI10.1016/0377-2217(89)90189-6zbMath0673.90032OpenAlexW2000974793MaRDI QIDQ1121152

Manfred Körkel

Publication date: 1989

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

Full work available at URL: https://doi.org/10.1016/0377-2217(89)90189-6

zbMATH Keywords

branch and boundlarge-scale problemstransportation costsplant locationErlenkotter's exact algorithmminimize the sum of the fixed charges

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Inventory, storage, reservoirs (90B05) Boolean programming (90C09)

Related Items (38)

Optimal algorithms for some inverse uncapacitated facility location problems on networks ⋮ Tactical network planning for food aid distribution in Kenya ⋮ A hybrid multistart heuristic for the uncapacitated facility location problem ⋮ SelfSplit parallelization for mixed-integer linear programming ⋮ Location and layout planning. A survey ⋮ Production planning and warehouse management in supply networks with inter-facility mold transfers ⋮ Matheuristics: survey and synthesis ⋮ Neighborhood search heuristics for the uncapacitated facility location problem ⋮ On a class of subadditive duals for the uncapacitated facility location problem ⋮ Solving a continuous local access network design problem with a stabilized central column generation approach ⋮ Semi-Lagrangian relaxation applied to the uncapacitated facility location problem ⋮ An interactive procedure dedicated to a bicriteria plant location model. ⋮ A branch-and-cut method for the obnoxious \(p\)-median problem ⋮ An exact cooperative method for the uncapacitated facility location problem ⋮ Threshold robustness in discrete facility location problems: a bi-objective approach ⋮ Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem ⋮ An algorithmic framework for the exact solution of tree-star problems ⋮ Risk management in uncapacitated facility location models with random demands ⋮ Fast bounding procedures for large instances of the simple plant location problem ⋮ An application of a Lagrangian-type relaxation for the uncapacitated facility location problem ⋮ Solving the simple plant location problem by genetic algorithm ⋮ Solving the uncapacitated facility location problem using tabu search ⋮ A simple tabu search for warehouse location ⋮ Facility location models for distribution system design ⋮ MIP models for connected facility location: a theoretical and computational study ⋮ Capacitated facility location problem with general setup cost ⋮ An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem ⋮ Location analysis: a synthesis and survey ⋮ An improved Lagrangian relaxation and dual ascent approach to facility location problems ⋮ An aggressive reduction scheme for the simple plant location problem ⋮ Lagrangean heuristics for location problems ⋮ A separation algorithm for the simple plant location problem ⋮ Solving the plant location problem on a line by linear programming ⋮ Separating lifted odd-hole inequalities to solve the index selection problem ⋮ Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing ⋮ Facility location with increasing production costs ⋮ A continuous location-allocation problem with zone-dependent fixed cost ⋮ Metaheuristic applications on discrete facility location problems: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
• A Lagrangean dual ascent algorithm for simple plant location problems
• A comparison of two dual-based procedures for solving the p-median problem
• Principal direction search: A new method of search for unconstrained LP formulations
• Location problems
• Facility location models for distribution planning
• 'Multidimensional' extensions and a nested dual approach for the m-median problem
• Optimal and heuristic algorithms for multiproduct uncapacitated facility location
• A tree search algorithm for the p-median problem
• Locational analysis
• Fast primal and dual heuristics for the \(p\)-median location problem
• The simple plant location problem: Survey and synthesis
• A Dual-Based Algorithm for Multiproduct Uncapacitated Facility Location
• A Fast Algorithm For The Greedy Interchange For Large-Scale Clustering And Median Location Problems
• A direct dual method for the mixed plant location problem with some side constraints
• Combined capacity planning and concentrator location in computer communications networks
• A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• Fractional vertices, cuts and facets of the simple plant location problem
• Some facets of the simple plant location polytope
• A Dual-Based Procedure for Dynamic Facility Location
• Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph

This page was built for publication: On the exact solution of large-scale simple plant location problems