Pages that link to "Item:Q1926885"

The following pages link to A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885):

Displaying 13 items.

• A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
• A hypergraph multi-exchange heuristic for the single-source capacitated facility location problem (Q1695027) (← links)
• An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
• The capacitated mobile facility location problem (Q1737488) (← links)
• An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
• On single-source capacitated facility location with cost and fairness objectives (Q2029269) (← links)
• A new extended formulation with valid inequalities for the capacitated concentrator location problem (Q2029271) (← links)
• Distributionally robust multi-period location-allocation with multiple resources and capacity levels in humanitarian logistics (Q2103001) (← links)
• A dual RAMP algorithm for single source capacitated facility location problems (Q2240710) (← links)
• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• The incorporation of fixed cost and multilevel capacities into the discrete and continuous single source capacitated facility location problem (Q2327679) (← links)
• An integrated approach for a new flexible multi-product disassembly line balancing problem (Q2676357) (← links)
• Benders-type branch-and-cut algorithms for capacitated facility location with single-sourcing (Q6113311) (← links)