Pages that link to "Item:Q5712453"

The following pages link to Integer Programming and Combinatorial Optimization (Q5712453):

Displaying 17 items.

• Branch-and-cut-and-price algorithms for the degree constrained minimum spanning tree problem (Q263164) (← links)
• A branch-and-cut framework for the consistent traveling salesman problem (Q320686) (← links)
• A branch-and-cut algorithm for the profitable windy rural postman problem (Q321108) (← links)
• 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)
• The separation problem of rounded capacity inequalities: some polynomial cases (Q1751206) (← links)
• The hierarchical mixed rural postman problem: polyhedral analysis and a branch-and-cut algorithm (Q1752763) (← links)
• OAR lib: an open source arc routing library (Q2293658) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure (Q2802246) (← links)
• Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
• Constraint relaxation for the discrete ordered median problem (Q6081610) (← links)
• The biobjective minimum-cost perfect matching problem and Chinese postman problem (Q6495384) (← links)