Pages that link to "Item:Q4864872"
From MaRDI portal
The following pages link to Capacitated Facility Location: Valid Inequalities and Facets (Q4864872):
Displayed 15 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)
- Capacitated facility location: Separation algorithms and computational experience (Q1290613) (← 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)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- Primal-Dual Schema for Capacitated Covering Problems (Q3503854) (← links)
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site (Q4405938) (← links)
- Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
- (Q4949164) (← links)
- A family of facets for the uncapacitated \(p\)-median polytope (Q5945384) (← links)
- Flow pack facets of the single node fixed-charge flow polytope (Q5952067) (← links)