A Dual-Based Procedure for Uncapacitated Facility Location

logistic computational experience uncapacitated facility location optimal dual solutions linear programming dual formulation simple dual procedure of ascent and adjustment

Mathematics Subject Classification ID

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)

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
A computational comparison of several formulations for the multi-period incremental service facility location problem
Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items
Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution
Formulations and relaxations for a multi-echelon capacitated location-distribution problem
Siting noxious facilities under uncertainty
Efficient algorithms for the capacitated concentrator location problem
Efficient primal-dual heuristic for a dynamic location problem
Models and algorithms for network reduction
Tactical network planning for food aid distribution in Kenya
A branch-and-bound algorithm for the multi-level uncapacitated facility location problem
Solving capacitated clustering problems
Upper and lower bounds for the single source capacitated location problem.
Solving the uncapacitated facility location problem using tabu search
\(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis
A repeated matching heuristic for the single-source capacitated facility location problem
New local searches for solving the multi-source Weber problem
A comparison of heuristics and relaxations for the capacitated plant location problem
A conditional \(p\)-hub location problem with attraction functions
Solving the simple plant location problem by genetic algorithm
Location analysis: a synthesis and survey
Lagrangean relaxation. (With comments and rejoinder).
Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type
Optimal Physician assignment and patient demand allocation in an outpatient care network
Lagrangean relaxation-based techniques for solving facility location problems
Facility location models for distribution planning
An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
Simple plant location under uniform delivered pricing
Dynamic versions of set covering type public facility location problems
Locational analysis
The simple plant location problem: Survey and synthesis
Risk management in uncapacitated facility location models with random demands
A comparison of two dual-based procedures for solving the p-median problem
'Multidimensional' extensions and a nested dual approach for the m-median problem
Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing
Budget constrained location problem with opening and closing of facilities.
A large scale location-allocation problem in the natural rubber industry
Constraint satisfaction problems: Algorithms and applications
Configuration of fully replicated distributed database system over wide area networks
A multiperiod two-echelon multicommodity capacitated plant location problem
A combinatorial approach to level of repair analysis
Facility siting and integer-friendly programming
A branch and bound algorithm for the traveling purchaser problem
A projection method for the uncapacitated facility location problem
Plant location with minimum inventory
A Lagrangian heuristic for the capacitated plant location problem with single source constraints
The capacitated plant location problem
Facility location with increasing production costs
Solving the plant location problem on a line by linear programming
Planning and scheduling packaging lines in food industry
A model for the capacitated \(p\)-facility location problem in global environments
Near-optimal solutions to large-scale facility location problems
Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing
An improved Lagrangian relaxation and dual ascent approach to facility location problems
Topological design of a two-level network with ring-star configuration
Efficient reformulations for dynamic lot-sizing problems with product substitution
Dynamic-demand capacitated facility location problems with and without relocation
A new local search for continuous location problems
An aggressive reduction scheme for the simple plant location problem
A Lagrangean heuristic for the facility location problem with staircase costs
Dynamic supply chain design with inventory
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

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)