Pages that link to "Item:Q2815470"
From MaRDI portal
The following pages link to A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem (Q2815470):
Displaying 18 items.
- You've come a long way, Bayesians (Q266667) (← links)
- Benders decomposition without separability: a computational study for capacitated facility location problems (Q323204) (← links)
- Solving a dynamic facility location problem with partial closing and reopening (Q342268) (← links)
- A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints (Q761340) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- On the computational efficiency of subgradient methods: a case study with Lagrangian bounds (Q1697974) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- Lagrangian-relaxation-based solution procedures for a multiproduct capacitated facility location problem with choice of facility type (Q1809805) (← links)
- A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem (Q1814816) (← links)
- Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
- A fast exact method for the capacitated facility location problem with differentiable convex production costs (Q2030454) (← links)
- An algorithm for a class of uncapacitated facility location problem based on branch-and-cut method (Q2993681) (← links)
- Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities (Q4599310) (← links)
- Branch-and-Bound Algorithms for a Regional Water Authority Distribution Problem (Q4849288) (← links)
- Implementing Automatic Benders Decomposition in a Modern MIP Solver (Q5041736) (← links)
- A Branch-and-Price Algorithm for the Multiple Knapsack Problem (Q5060791) (← links)
- Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)
- A logistics provider's profit maximization facility location problem with random utility maximizing followers (Q6568468) (← links)
