A Dual-Based Procedure for Uncapacitated Facility Location
DOI10.1287/OPRE.26.6.992zbMATH Open0422.90053OpenAlexW2165012734MaRDI QIDQ3856429FDOQ3856429
Authors: Donald Erlenkotter
Publication date: 1978
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.26.6.992
logisticcomputational experienceuncapacitated facility locationoptimal dual solutionslinear programming dual formulationsimple dual procedure of ascent and adjustment
Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)
Cited In (only showing first 100 items - show all)
- Fast bounding procedures for large instances of the simple plant location problem
- A bi-objective uncapacitated facility location problem
- Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
- An homage to Joseph-Louis Lagrange and Pierre Huard
- Dual ascent: variations of a theme
- Incorporating cellular manufacturing into supply chain design
- Optimal design of a distributed network with a two-level hierarchical structure
- A simple and deterministic competitive algorithm for online facility location
- An application-oriented guide for designing Lagrangean dual ascent algorithms
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs
- Lower bounds for the two-stage uncapacitated facility location problem
- Capacity planning with congestion effects
- Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
- Dual-based approach for a hub network design problem under non-restrictive policy
- A tree search algorithm for the p-median problem
- Optimal and heuristic algorithms for multiproduct uncapacitated facility location
- The stochastic location-assignment problem on a tree
- An exact solution procedure for a cluster hub location problem
- Algorithms for a multi-level network optimization problem
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Semi-Lagrangian relaxation applied to the uncapacitated facility location problem
- Separating lifted odd-hole inequalities to solve the index selection problem
- Reason based solutions and the complexity of distribution network design problems
- On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures
- Discrete facility location with nonlinear diseconomies in fixed costs
- Cross-facility management of production and transportation planning problem
- Capacity expansion with alternative technology choices
- Multiobjective solution of the uncapacitated plant location problem
- Clustering of objects and attributes for manufacturing and marketing applications
- Fast primal and dual heuristics for the \(p\)-median location problem
- A note on duality gap in the simple plant location problem
- A Lagrangean dual ascent algorithm for simple plant location problems
- A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand
- A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application
- New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach
- Uncapacitated facility location: General solution procedure and computational experience
- The plant location problem with demand-dependent setup costs and centralized allocation
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- A cost operator approach to multistage location-allocation
- Some personal views on the current state and the future of locational analysis
- An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure
- An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies
- Location and layout planning. A survey
- The general optimal market area model
- A robustness approach to international sourcing
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- Zero-one integer programs with few contraints - lower bounding theory
- A direct dual method for the mixed plant location problem with some side constraints
- A simple plant-location model for quantity-setting firms subject to price uncertainty
- An application of a Lagrangian-type relaxation for the uncapacitated facility location problem
- Modeling and Managing Uncertainty in Process Planning and Scheduling
- An exact cooperative method for the uncapacitated facility location problem
- Network production-location problems under price uncertainty
- A study on the budget constrained facility location model considering inventory management cost
- Automatic production planning of press brakes for sheet metal bending
- Using a facility location algorithm to solve large set covering problems
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
- A method for solving to optimality uncapacitated location problems
- LP extreme points and cuts for the fixed-charge network design problem
- The zone-constrained location problem on a network
- A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM
- An ex-post bound on the greedy heuristic for the uncapacitated facility location problem
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- The plant location and flexible technology acquisition problem.
- A Primal Approach to the Simple Plant Location Problem
- A novel differential evolution algorithm for binary optimization
- A simple filter-and-fan approach to the facility location problem
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- BEAMR: an exact and approximate model for the \(p\)-median problem
- On solving the discrete location problems when the facilities are prone to failure
- Solving covering problems and the uncapacitated plant location problem on trees
- Online facility location with facility movements
- Capacitated facility location problem with general setup cost
- The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
- A dual ascent approach for steiner tree problems on a directed graph
- A simple tabu search for warehouse location
- Facility location models for distribution system design
- Defining tabu list size and aspiration criterion within tabu search methods
- HubLocator: An exact solution method for the multiple allocation hub location problem
- A hybrid multistart heuristic for the uncapacitated facility location problem
- Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique
- The \(p\)-median problem: a survey of metaheuristic approaches
- A survey of algorithms for the generalized assignment problem
- Heuristics for the capacitated plant location model
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- On the exact solution of large-scale simple plant location problems
- Massively parallel analog tabu search using neural networks applied to simple plant location problems
- Planning models for freight transportation
- Integer programming formulations of discrete hub location problems
- Cluster analysis and mathematical programming
- Neighborhood search heuristics for the uncapacitated facility location problem
- A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem
- Sequential location-allocation problems on chains and trees with probabilistic link demands
- Variable neighborhood search
- Lagrangean heuristics for location problems
- Forecast horizons and dynamic facility location planning
- Uncapacitated and capacitated facility location problems
- Multi-level facility location as the maximization of a submodular set function
- A facility location model for logistics systems including reverse flows: the case of remanufacturing activities
This page was built for publication: A Dual-Based Procedure for Uncapacitated Facility Location
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3856429)