Pages that link to "Item:Q1742898"

The following pages link to An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898):

Displaying 11 items.

• SSCFLPsolver (Q46583) (← links)
• An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
• Solving the facility location and fixed charge solid transportation problem (Q1983711) (← links)
• Directed fixed charge multicommodity network design: a cutting plane approach using polar duality (Q2077967) (← links)
• Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics (Q2103001) (← links)
• The complete vertex \(p\)-center problem (Q2219518) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• An integrated approach for a new flexible multi-product disassembly line balancing problem (Q2676357) (← links)
• A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games (Q5085997) (← links)
• Bi-objective Branch-and-Cut Algorithms Based on LP Relaxation and Bound Sets (Q5139632) (← links)
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)