Pages that link to "Item:Q1827647"

The following pages link to Stronger \(K\)-tree relaxations for the vehicle routing problem (Q1827647):

Displaying 9 items.

• Heuristic and exact algorithms for a min-max selective vehicle routing problem (Q622161) (← links)
• Non delayed relax-and-cut algorithms (Q817212) (← links)
• Approximation algorithms for constructing spanning \(K\)-trees using stock pieces of bounded length (Q1686555) (← links)
• A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
• Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
• Robust branch-and-cut-and-price for the capacitated vehicle routing problem (Q2492675) (← links)
• A note on relatives to the Held and Karp 1-tree problem (Q2494821) (← links)
• Exact algorithms for the vertex separator problem in graphs (Q3008917) (← links)
• Shape Measures of Random Increasing <i>k</i>-trees (Q5366914) (← links)