A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
From MaRDI portal
Publication:3114903
DOI10.1287/mnsc.1030.0193zbMath1232.90257OpenAlexW2166420930WikidataQ59592507 ScholiaQ59592507MaRDI QIDQ3114903
Stefano Pallottino, Maria Paola Scaparra, Ravindra K. Ahuja, Maria Grazia Scutellà, James B. Orlin
Publication date: 19 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.646.2245
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59) Case-oriented studies in operations research (90B90)
Related Items
Exactly solving a two-level location problem with modular node capacities, A heuristic for BILP problems: the single source capacitated facility location problem, A cut-and-solve based algorithm for the single-source capacitated facility location problem, Multiple pickup and delivery traveling salesman problem with last-in-first-out loading and distance constraints, A Survey of the Generalized Assignment Problem and Its Applications, Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation, Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing, A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem, A variable neighborhood search heuristic for the design of multicommodity production-distribution networks with alternative facility configurations, Branch-and-cut-and-price for capacitated connected facility location, The capacitated mobile facility location problem, Scatter search for the single source capacitated facility location problem, Tariff concessions in production sourcing, An improved cut-and-solve algorithm for the single-source capacitated facility location problem, A dual RAMP algorithm for single source capacitated facility location problems, A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem, A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand, Optimizing over the split closure, Relaxations and exact solution of the variable sized bin packing problem, Benders decomposition, Lagrangean relaxation and metaheuristic design, A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources, A new extended formulation with valid inequalities for the capacitated concentrator location problem, Lower and upper bounds for a two-stage capacitated facility location problem with handling costs, A faster FPTAS for knapsack problem with cardinality constraint, An exact approach for cyclic inbound inventory routing in a level production system, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, The design of robust value-creating supply chain networks: a critical review, A faster FPTAS for knapsack problem with cardinality constraint, Combining very large scale and ILP based neighborhoods for a two-level location problem, Metaheuristic applications on discrete facility location problems: a survey
