An exact method for the two-echelon, single-source, capacitated facility location problem
From MaRDI portal
Publication:1572966
DOI10.1016/S0377-2217(99)00105-8zbMath0991.90083OpenAlexW2075035506MaRDI QIDQ1572966
Publication date: 6 August 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(99)00105-8
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Discrete location and assignment (90B80)
Related Items
Exactly solving a two-level location problem with modular node capacities, A facility location model for logistics systems including reverse flows: the case of remanufacturing activities, A two-level location-allocation problem in designing local access fiber optic networks, A multi-objective bi-level location planning problem for stone industrial parks, A scatter search-based heuristic to locate capacitated transshipment points, Meta-heuristic approaches with memory and evolution for a multi-product production/distribution system design problem, Solving the robust two-stage capacitated facility location problem with uncertain transportation costs, A multi-objective chance-constrained network optimal model with random fuzzy coefficients and its application to logistics distribution center location problem, Formulation and solution of a two-stage capacitated facility location problem with multilevel capacities, The capacitated mobile facility location problem, A LAGRANGIAN-BASED SOLUTION ALGORITHM FOR STRATEGIC SUPPLY CHAIN DISTRIBUTION DESIGN IN UNCERTAIN ENVIRONMENT, Multi-level facility location problems, A two-echelon stochastic facility location model for humanitarian relief logistics, A genetic algorithm for solving the fixed-charge transportation model: two-stage problem, A multi-product production/distribution system design problem with direct shipments and lateral transshipments, The vendor location problem, A genetic algorithm for two-stage transportation problem using priority-based encoding, Combining very large scale and ILP based neighborhoods for a two-level location problem, Designing a distribution network in a supply chain system: formulation and efficient solution procedure
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints
- A heuristic lagrangean algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A method for solving to optimality uncapacitated location problems
- Facility location models for distribution planning
- Efficient algorithms for the capacitated concentrator location problem
- An algorithm for solving large capacitated warehouse location problems
- An exact algorithm for the capacitated facility location problems with single sourcing
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A repeated matching heuristic for the single-source capacitated facility location problem
- Lagrangean heuristics for location problems
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- A Multiplier Adjustment Method for the Generalized Assignment Problem
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- An Overview of Representative Problems in Location Research
- An Algorithm for Large Zero-One Knapsack Problems
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- A dual-based optimization procedure for the two-echelon uncapacitated facility location problem
- A branch and bound algorithm for the generalized assignment problem
- A Plant and Warehouse Location Problem
- An Improved Algorithm for the Capacitated Facility Location Problem
- A Survey of Lagrangean Techniques for Discrete Optimization
