A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
From MaRDI portal
Recommendations
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- Integer Programming and Combinatorial Optimization
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- A repeated matching heuristic for the single-source capacitated facility location problem
- An exact algorithm for the capacitated facility location problems with single sourcing
- scientific article; zbMATH DE number 1187081
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- AI 2005: Advances in Artificial Intelligence
- A heuristic for BILP problems: the single source capacitated facility location problem
- A Heuristic for the Capacitated Single Allocation Hub Location Problem
Cited in
(42)- The design of robust value-creating supply chain networks: a critical review
- An exact algorithm for the capacitated facility location problems with single sourcing
- A large neighborhood search heuristic for supply chain network design
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- The capacitated mobile facility location problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Single-source capacitated multi-facility Weber problem-an iterative two phase heuristic algorithm
- 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
- On single-source capacitated facility location with cost and fairness objectives
- A new extended formulation with valid inequalities for the capacitated concentrator location problem
- A dual RAMP algorithm for single source capacitated facility location problems
- Benders decomposition, Lagrangean relaxation and metaheuristic design
- An exact approach for cyclic inbound inventory routing in a level production system
- Combining very large scale and ILP based neighborhoods for a two-level location problem
- Tariff concessions in production sourcing
- Optimizing over the split closure
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
- Metaheuristic applications on discrete facility location problems: a survey
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- Exactly solving a two-level location problem with modular node capacities
- A heuristic for BILP problems: the single source capacitated facility location problem
- A heuristic approach to the single facility maximin location problem
- Large-scale local search heuristics for the capacitated vertexp-center problem
- Multi-capacitated Location Problem: A New Resolution Method Combining Exact and Heuristic Approaches Based on Set Partitioning
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand
- Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
- Relaxations and exact solution of the variable sized bin packing problem
- A Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
- AI 2005: Advances in Artificial Intelligence
- A faster FPTAS for knapsack problem with cardinality constraint
- A faster FPTAS for knapsack problem with cardinality constraint
- A Survey of the Generalized Assignment Problem and Its Applications
- Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz -optimal approach using Lagrangian relaxation
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- Enhanced capacitated facility location problem for mental accounting management using partial resource concentration
- 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
- A vehicle routing problem with pickup and delivery time windows, and coordination of transportable resources
- An augmented Lagrangian decomposition method for the single-source capacitated facility location problem
- Scatter search for the single source capacitated facility location problem
- A heuristic based on multi-exchange techniques for a regional fleet assignment location-routing problem
This page was built for publication: A Multi-Exchange Heuristic for the Single-Source Capacitated Facility Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3114903)
