The following pages link to (Q4461905):
Displaying 11 items.
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
- SelfSplit parallelization for mixed-integer linear programming (Q1652584) (← links)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- The traveling salesman problem with draft limits (Q1761142) (← links)
- The time dependent traveling salesman problem: polyhedra and algorithm (Q1947199) (← links)
- Facets from gadgets (Q2220662) (← links)
- Exact algorithms for the traveling salesman problem with draft limits (Q2256207) (← links)
- New facets of the STS polytope generated from known facets of the ATS polytope (Q2494809) (← links)
- Facet Generating Techniques (Q2971603) (← links)
- Asymmetric Multidepot Vehicle Routing Problems: Valid Inequalities and a Branch-and-Cut Algorithm (Q4994165) (← links)
- Tight lower bounds for the traveling salesman problem with draft limits (Q6109566) (← links)