An exact algorithm for the capacitated facility location problems with single sourcing
From MaRDI portal
Publication:1124811
DOI10.1016/S0377-2217(98)00008-3zbMath0947.90059OpenAlexW1993229675WikidataQ127674558 ScholiaQ127674558MaRDI QIDQ1124811
Mikael Rönnqvist, Kaj Holmberg, Di Yuan
Publication date: 8 November 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(98)00008-3
Integer programming (90C10) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
A bi-objective approach to discrete cost-bottleneck location problems, Exactly solving a two-level location problem with modular node capacities, A heuristic for BILP problems: the single source capacitated facility location problem, Convexification of Queueing Formulas by Mixed-Integer Second-Order Cone Programming: An Application to a Discrete Location Problem with Congestion, MIP reformulations of the probabilistic set covering problem, A facility location model for logistics systems including reverse flows: the case of remanufacturing activities, An implementation of exact knapsack separation, Efficient solution of a class of location-allocation problems with stochastic demand and congestion, A cutting plane algorithm for the capacitated connected facility location problem, Designing a service system with price- and distance-sensitive demand: a case study in mining industry, Bilevel Integer Programs with Stochastic Right-Hand Sides, A matheuristic for solving the bilevel approach of the facility location problem with cardinality constraints and preferences, A cut-and-solve based algorithm for the single-source capacitated facility location problem, Robust design of service systems with immobile servers under demand uncertainty, The value of the multi-period solution revisited: when to model time in capacitated location problems, Designing service system networks with interruption risks, 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, Locating Satellite Yards in Forestry Operations, Modeling and solving an economies‐of‐scale service system design problem, Upper and lower bounds for the single source capacitated location problem., Location of slaughterhouses under economies of scale, The capacitated mobile facility location problem, Scatter search for the single source capacitated facility location problem, 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 Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints, Stochastic facility location with general long-run costs and convex short-run costs, Optimizing over the split closure, The vendor location problem, Facility location models for distribution system design, On the capacitated concentrator location problem: a reformulation by discretization, Benders decomposition, Lagrangean relaxation and metaheuristic design, Outbound supply chain network design with mode selection, lead times and capacitated vehicle distribution centers, On single-source capacitated facility location with cost and fairness objectives, A new extended formulation with valid inequalities for the capacitated concentrator location problem, Data-driven distributionally robust capacitated facility location problem, Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem, A computational evaluation of a general branch-and-price framework for capacitated network location problems, Graphs and Algorithms in Communication Networks on Seven League Boots, An exact method for the two-echelon, single-source, capacitated facility location problem, Hybrid scatter search and path relinking for the capacitated \(p\)-median problem, Probabilistic Guarantees in Robust Optimization, Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics, A Computational Investigation on the Strength of Dantzig-Wolfe Reformulations, Combining very large scale and ILP based neighborhoods for a two-level location problem, Metaheuristic applications on discrete facility location problems: a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Efficient algorithms for the capacitated concentrator location problem
- Aircrew schedule generation using repeated matching
- Lagrangean heuristics for location problems
- A new heuristic for the fleet size and mix vehicle routing problem
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Algorithm for the Fixed-Charge Assigning Users to Sources Problem
- A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints
- A Dual-Based Procedure for Uncapacitated Facility Location
- Parallel Savings Based Heuristics for the Delivery Problem
- A Repeated Matching Heuristic for the Vehicle Routeing Problem
- Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
- Minimization of unsmooth functionals
