Pages that link to "Item:Q2457618"
From MaRDI portal
The following pages link to Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618):
Displaying 10 items.
- A heuristic for BILP problems: the single source capacitated facility location problem (Q296777) (← links)
- An effective hybrid approach to the two-stage capacitated facility location problem (Q1713740) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- Lower tolerance-based branch and bound algorithms for the ATSP (Q1761975) (← links)
- A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← 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)
- A symmetry-free polynomial formulation of the capacitated vehicle routing problem (Q2664007) (← links)
- Discrete heat transfer search for solving travelling salesman problem (Q2668543) (← links)
- An integrated approach for a new flexible multi-product disassembly line balancing problem (Q2676357) (← links)
