Pages that link to "Item:Q4864872"

The following pages link to Capacitated Facility Location: Valid Inequalities and Facets (Q4864872):

Displaying 25 items.

• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• Cutting planes in integer and mixed integer programming (Q697578) (← links)
• Primal-dual schema for capacitated covering problems (Q747765) (← links)
• A cutting plane algorithm for the capacitated facility location problem (Q842775) (← 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)
• An effective heuristic for large-scale capacitated facility location problems (Q1044245) (← 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)
• The impact of filtering in a branch-and-cut algorithm for multicommodity capacitated fixed charge network design (Q1616826) (← links)
• Container shipping service selection and cargo routing with transshipment limits (Q1694945) (← links)
• Valid inequalities for the single arc design problem with set-ups (Q1751105) (← links)
• Supermodular covering knapsack polytope (Q1751131) (← 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)
• Mixed \(n\)-step MIR inequalities: facets for the \(n\)-mixing set (Q1926486) (← links)
• Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
• Integrated design and operation of remnant inventory supply chains under uncertainty (Q2275828) (← links)
• A cutting plane algorithm for the capacitated connected facility location problem (Q2393652) (← links)
• Branch-and-price-and-cut for large-scale multicommodity capacitated fixed-charge network design (Q2513734) (← links)
• LP-Based Algorithms for Capacitated Facility Location (Q2968155) (← links)
• Polyhedral techniques in combinatorial optimization I: Theory (Q4715790) (← links)
• A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)