A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
From MaRDI portal
Recommendations
- A branch-and-price algorithm for the capacitated facility location problem
- Efficient solution of large scale, single-source, capacitated plant location problems
- Branch and price for large-scale capacitated hub location problems with single assignment
- An exact algorithm for the capacitated facility location problems with single sourcing
- Bounds for the single source modular capacitated plant location problem
Cited in
(26)- A computational evaluation of a general branch-and-price framework for capacitated network location problems
- A bi-objective approach to discrete cost-bottleneck location problems
- A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem
- Integrated districting, fleet composition, and inventory planning for a multi-retailer distribution system
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- A compact model and tight bounds for a combined location-routing problem
- General network design: a unified view of combined location and network design problems
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics
- A distributionally robust optimization approach for two-stage facility location problems
- A cutting plane algorithm for the capacitated connected facility location problem
- Revisiting Lagrangian relaxation for network design
- Bounds for the single source modular capacitated plant location problem
- Capacitated plant selection in a decentralized manufacturing environment: a bilevel optimization approach
- Hybrid scatter search and path relinking for the capacitated \(p\)-median problem
- Using logic-based Benders decomposition to solve the capacity- and distance-constrained plant location problem
- A heuristic for BILP problems: the single source capacitated facility location problem
- An implementation of exact knapsack separation
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- Fast scenario reduction by conditional scenarios in two-stage stochastic MILP problems
- Reactive Grasp And Tabu Search Based Heuristics For The Single Source Capacitated Plant Location Problem
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing
- Locating Satellite Yards in Forestry Operations
- A computational comparison of several models for the exact solution of the capacity and distance constrained plant location problem
- A branch-and-price algorithm for the capacitated facility location problem
- Scatter search for the single source capacitated facility location problem
This page was built for publication: A Branch-and-Price algorithm for the Single Source Capacitated Plant Location Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4656678)
