Pages that link to "Item:Q5712453"
From MaRDI portal
The following pages link to Integer Programming and Combinatorial Optimization (Q5712453):
Displayed 8 items.
- Non delayed relax-and-cut algorithms (Q817212) (← links)
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems (Q833572) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- Undirected postman problems with zigzagging option: a cutting-plane approach (Q925846) (← links)
- Exploiting planarity in separation routines for the symmetric traveling salesman problem (Q951094) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)