Pages that link to "Item:Q811347"
From MaRDI portal
The following pages link to A comparison of heuristics and relaxations for the capacitated plant location problem (Q811347):
Displaying 28 items.
- Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
- A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
- Learning pseudo-backdoors for mixed integer programs (Q2170189) (← links)
- RAMP algorithms for the capacitated facility location problem (Q2240709) (← links)
- A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
- A Lagrangian heuristic for the capacitated plant location problem with single source constraints (Q2367382) (← links)
- Revisiting Lagrangian relaxation for network design (Q2414466) (← links)
- Solving the variable size bin packing problem with discretized formulations (Q2462559) (← links)
- Star \(p\)-hub median problem with modular arc capacities (Q2475857) (← links)
- Capacitated facility location problem with general setup cost (Q2496021) (← links)
- Towards optimizing the deployment of optical access networks (Q2513732) (← links)
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs (Q2514748) (← links)
- Locating repair shops in a stochastic environment (Q2581600) (← links)
- Classification of Dantzig-Wolfe reformulations for binary mixed integer programming problems (Q2655613) (← links)
- Add/drop procedures for the capacitated plant location problem (Q2741478) (← links)
- Experiments with primal - dual decomposition and subgradient methods for the uncapacitatied facility location problem (Q2743665) (← links)
- A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470) (← links)
- Dynamic-demand capacitated facility location problems with and without relocation (Q3005806) (← links)
- (Q3153223) (← links)
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
- A capacitated facility location problem with constrained backlogging probabilities (Q5428725) (← links)
- Continuous cutting plane algorithms in integer programming (Q6047699) (← links)
- Adjustable robust optimization with objective uncertainty (Q6069242) (← links)
- Lagrangian bounds for large‐scale multicommodity network design: a comparison between Volume and Bundle methods (Q6070422) (← links)
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)
- Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic (Q6167880) (← links)
- The dynamic facility location problem with mobile production units: a waste recycling application (Q6568405) (← links)
- A logistics provider's profit maximization facility location problem with random utility maximizing followers (Q6568468) (← links)