A Dual-Based Procedure for Uncapacitated Facility Location
From MaRDI portal
Publication:3856429
DOI10.1287/opre.26.6.992zbMath0422.90053OpenAlexW2165012734MaRDI QIDQ3856429
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
computational experiencelogisticuncapacitated facility locationoptimal dual solutionslinear programming dual formulationsimple dual procedure of ascent and adjustment
Mixed integer programming (90C11) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Inventory, storage, reservoirs (90B05) Discrete location and assignment (90B80)
Related Items
Lagrangean relaxation. (With comments and rejoinder)., Reason based solutions and the complexity of distribution network design problems, Uncapacitated facility location: General solution procedure and computational experience, Capacity expansion with alternative technology choices, A Lagrangian heuristic for the capacitated plant location problem with single source constraints, Topological design of a two-level network with ring-star configuration, Optimal algorithms for some inverse uncapacitated facility location problems on networks, A study on the budget constrained facility location model considering inventory management cost, Application of the facility location problem to the problem of locating concentrators on an FAA microwave system, On the coordination of product and by-product flows in two-level distribution networks: Model formulations and solution procedures, A decomposition approach to solve a bilevel capacitated facility location problem with equity constraints, A novel differential evolution algorithm for binary optimization, A monotonic, dual-based bounding procedure for integer programs, Efficient reformulations for dynamic lot-sizing problems with product substitution, Stochastic Dual Dynamic Programming for Multiechelon Lot Sizing with Component Substitution, Dynamic supply chain design with inventory, BEAMR: an exact and approximate model for the \(p\)-median problem, A robustness approach to international sourcing, Parallel algorithms for a multi-level network optimization problem, Cluster analysis and mathematical programming, A parallel branch-and-bound algorithm for multicommodity location with balancing requirements, Location and layout planning. A survey, A model for the capacitated \(p\)-facility location problem in global environments, Variable neighborhood search, A direct dual method for the mixed plant location problem with some side constraints, Heuristicas de descomposicion lagrangiana para algunos problemas de localizacion discreta, Discrete equal-capacityp-median problem, A facility location model with safety stock costs: analysis of the cost of single-sourcing requirements, Parametric uncapacitated facility location, The capacitated plant location problem, Combined capacity planning and concentrator location in computer communications networks, Neighborhood search heuristics for the uncapacitated facility location problem, LP extreme points and cuts for the fixed-charge network design problem, Lagrangean decomposition: A model yielding stronger lagrangean bounds, Upper and lower bounds for the single source capacitated location problem., An interactive procedure dedicated to a bicriteria plant location model., Budget constrained location problem with opening and closing of facilities., Incorporating cellular manufacturing into supply chain design, Affinity propagation: An exemplar‐based tool for clustering in psychological research, A two-phased approach to the supply network reconfiguration problem, A dual ascent procedure for the exact formulation of the simple plant location problem with spatial interaction, Dynamic-demand capacitated facility location problems with and without relocation, RAMP algorithms for the capacitated facility location problem, A dual RAMP algorithm for single source capacitated facility location problems, Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem, A dual ascent approach for steiner tree problems on a directed graph, Multi-level facility location problems, On solving the discrete location problems when the facilities are prone to failure, Unnamed Item, A new local search for continuous location problems, Algorithmic expedients for the \(S\)-labeling problem, 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, Dual-based approach for a hub network design problem under non-restrictive policy, Solving the uncapacitated facility location problem using tabu search, A simple filter-and-fan approach to the facility location problem, Worst-case performance of Wong's Steiner tree heuristic, Simple dynamic location problem with uncertainty: a primal-dual heuristic approach, 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, Cross-facility management of production and transportation planning problem, Near-optimal solutions to large-scale facility location problems, An improved Lagrangian relaxation and dual ascent approach to facility location problems, An aggressive reduction scheme for the simple plant location problem, [NO TITLE AVAILABLE], A branch-and-bound method for multicommodity location with balancing requirements, Lagrangean heuristics for location problems, The plant location problem with demand-dependent setup costs and centralized allocation, Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type, Exact solution methods for uncapacitated location problems with convex transportation costs, Constraint satisfaction problems: Algorithms and applications, A NEW FORMULATION AND RELAXATION OF THE SIMPLE PLANT LOCATION PROBLEM, A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem, Modeling and Managing Uncertainty in Process Planning and Scheduling, A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem, An application-oriented guide for designing Lagrangean dual ascent algorithms, Using injection points in reformulation local search for solving continuous location problems, A multiperiod two-echelon multicommodity capacitated plant location problem, Clustering of objects and attributes for manufacturing and marketing applications, An ex-post bound on the greedy heuristic for the uncapacitated facility location problem, The simple plant location problem: Survey and synthesis, Solving covering problems and the uncapacitated plant location problem on trees, A combinatorial approach to level of repair analysis, Notation and classification for logistic network design models, A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem, Uncapacitated and Capacitated Facility Location Problems, Exact Solution of Two Location Problems via Branch-and-Bound, Lagrangean Relaxation-Based Techniques for Solving Facility Location Problems, An optimization approach to plan for reusable software components, Solving large-scale uncapacitated facility location problems with evolutionary simulated annealing, Automatic production planning of press brakes for sheet metal bending, Sequential location-allocation problems on chains and trees with probabilistic link demands, Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality, A 3-approximation algorithm for the \(k\)-level uncapacitated facility location problem, Facility location with increasing production costs, A Primal Approach to the Simple Plant Location Problem, Multiobjective solution of the uncapacitated plant location problem, A repeated matching heuristic for the single-source capacitated facility location problem, Matheuristics: survey and synthesis, Agile optimization for a real‐time facility location problem in Internet of Vehicles networks, Polyhedral results and stronger Lagrangean bounds for stable spanning trees, Siting noxious facilities under uncertainty, Capacity planning with congestion effects, The plant location and flexible technology acquisition problem., Defining tabu list size and aspiration criterion within tabu search methods, An integrated model for facility location and technology acquisition, HubLocator: An exact solution method for the multiple allocation hub location problem, Affinity propagation and uncapacitated facility location problems, Optimal and heuristic algorithms for multiproduct uncapacitated facility location, A conditional \(p\)-hub location problem with attraction functions, Efficient algorithms for the capacitated concentrator location problem, Multi-level facility location as the maximization of a submodular set function, Models and algorithms for network reduction, A facility location model for logistics systems including reverse flows: the case of remanufacturing activities, Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort, Tactical network planning for food aid distribution in Kenya, \(p\)-median and \(p\)-dispersion problems: a bi-criteria analysis, Efficient primal-dual heuristic for a dynamic location problem, A note on duality gap in the simple plant location problem, A hybrid multistart heuristic for the uncapacitated facility location problem, An exact solution procedure for a cluster hub location problem, Lagrangian heuristics for the capacitated multi-plant lot sizing problem with multiple periods and items, Optimal Physician assignment and patient demand allocation in an outpatient care network, Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs, The \(p\)-median problem: a survey of metaheuristic approaches, The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation, Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique, Lower bounds for the two-stage uncapacitated facility location problem, On the exact solution of large-scale simple plant location problems, An exact algorithm for the capacitated facility location problems with single sourcing, A computational comparison of several formulations for the multi-period incremental service facility location problem, New filtering for \textsc{AtMostNValue} and its weighted variant: a Lagrangian approach, Solving a distribution problem with side constraints, Simple plant location under uniform delivered pricing, Developments in network location with mobile and congested facilities, A cost operator approach to multistage location-allocation, A large scale location-allocation problem in the natural rubber industry, On a class of subadditive duals for the uncapacitated facility location problem, Semi-Lagrangian relaxation applied to the uncapacitated facility location problem, A Lagrangean dual ascent algorithm for simple plant location problems, A dual ascent algorithm for the 1-tree relaxation of the symmetric traveling salesman problem, A tree search algorithm for the p-median problem, A projection method for the uncapacitated facility location problem, The general optimal market area model, A method for solving to optimality uncapacitated location problems, Discrete facility location with nonlinear diseconomies in fixed costs, Models for multimode multicommodity location problems with interdepot balancing requirements, Dynamic versions of set covering type public facility location problems, Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem, Locational analysis, Fast primal and dual heuristics for the \(p\)-median location problem, A solution procedure for the file allocation problem with file availability and response time, An exact cooperative method for the uncapacitated facility location problem, A comparative study of modeling and solution approaches for the coordinated lot-size problem with dynamic demand, New local searches for solving the multi-source Weber problem, A dynamic location problem with maximum decreasing capacities, A fuzzy set-theoretic method for public facility location, Configuration of fully replicated distributed database system over wide area networks, Locating concentrators in centralized computer networks, An integrated evaluation of facility location, capacity aquisition, and technology selection for designing global manufacturing strategies, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, A survey of algorithms for the generalized assignment problem, Risk management in uncapacitated facility location models with random demands, Forecast horizons and dynamic facility location planning, Formulations and relaxations for a multi-echelon capacitated location-distribution problem, Optimal design of a distributed network with a two-level hierarchical structure, An homage to Joseph-Louis Lagrange and Pierre Huard, Dual ascent: variations of a theme, Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution, Online facility location with facility movements, A simple and deterministic competitive algorithm for online facility location, A simple tabu search for warehouse location, Facility location models for distribution system design, A multi-stage facility location problem with staircase costs and splitting of commodities: model, heuristic approach and application, File allocation involving worst case response times and link capacities: Model and solution procedure, Facility siting and integer-friendly programming, Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing, Massively parallel analog tabu search using neural networks applied to simple plant location problems, A bi-objective uncapacitated facility location problem, Optimal location and capacity of emergency cleanup equipment for oil spill response, A Lagrangean heuristic for the facility location problem with staircase costs, Planning models for freight transportation, A branch and bound algorithm for the traveling purchaser problem, Solving the plant location problem on a line by linear programming, Plant location with minimum inventory, Some personal views on the current state and the future of locational analysis, Network production-location problems under price uncertainty, Heuristics for the capacitated plant location model, Separating lifted odd-hole inequalities to solve the index selection problem, A branch-and-bound algorithm for the multi-level uncapacitated facility location problem, Using a facility location algorithm to solve large set covering problems, A comparison of two dual-based procedures for solving the p-median problem, A tree search algorithm for the multi-commodity location problem, Principal direction search: A new method of search for unconstrained LP formulations, Algorithms for a multi-level network optimization problem, A simple plant-location model for quantity-setting firms subject to price uncertainty, Solving capacitated clustering problems, Planning and scheduling packaging lines in food industry, Zero-one integer programs with few contraints - lower bounding theory, Integer programming formulations of discrete hub location problems, An extension of the \(p\)-median group technology algorithm, The zone-constrained location problem on a network, Facility location models for distribution planning, A comparison of heuristics and relaxations for the capacitated plant location problem, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type, 'Multidimensional' extensions and a nested dual approach for the m-median problem, An improved IP formulation for the uncapacitated facility location problem: capitalizing on objective function structure, The stochastic location-assignment problem on a tree
