Pages that link to "Item:Q1290613"
From MaRDI portal
The following pages link to Capacitated facility location: Separation algorithms and computational experience (Q1290613):
Displayed 17 items.
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Polyhedral analysis for concentrator location problems (Q853560) (← links)
- On solving large instances of the capacitated facility location problem (Q859676) (← links)
- A branch-and-price algorithm for the capacitated facility location problem (Q864031) (← links)
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem (Q1584797) (← links)
- New modeling approaches for the design of local access transport area networks (Q1590803) (← links)
- A branch and cut algorithm for hub location problems with single assignment (Q1771311) (← links)
- Near-optimal solutions to large-scale facility location problems (Q1779687) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- Multi-period capacitated location with modular equipments (Q2456628) (← links)
- Parallel metaheuristics for workforce planning (Q2466392) (← links)
- Exact procedures for solving the discrete ordered median problem (Q2499160) (← links)
- Locating repair shops in a stochastic environment (Q2581600) (← links)
- Sequence independent lifting for mixed integer programs with variable upper bounds (Q2583140) (← links)
- A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)
- A new method for solving capacitated location problems based on a set partitioning approach (Q5959081) (← links)