The following pages link to William Cook (Q744211):
Displaying 50 items.
- (Q580172) (redirect page) (← links)
- On the complexity of cutting-plane proofs (Q580175) (← links)
- A hybrid branch-and-bound approach for exact rational mixed-integer programming (Q744213) (← links)
- Integral infeasibility and testing total dual integrality (Q757248) (← links)
- A note on matchings and separability (Q802467) (← links)
- Chvátal closures for mixed integer programming problems (Q922950) (← links)
- Certification of an optimal TSP tour through 85,900 cities (Q1002076) (← links)
- An integer analogue of Carathéodory's theorem (Q1074117) (← links)
- On the solution of traveling salesman problems (Q1126862) (← links)
- The discipline number of a graph (Q1174136) (← links)
- Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems (Q1403285) (← links)
- Computational experience with parallel mixed integer programming in a distributed environment (Q1808186) (← links)
- Cutting-plane proofs in polynomial space (Q1813835) (← links)
- Operations that preserve total dual integrality (Q1837522) (← links)
- Markowitz and Manne + Eastman + Land and Doig = branch and bound (Q1946023) (← links)
- Maximum-weight stable sets and safe lower bounds for graph coloring (Q1946922) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Exact solutions to linear programming problems (Q2467437) (← links)
- On the Matrix-Cut Rank of Polyhedra (Q2757665) (← links)
- Solution of a Min-Max Vehicle Routing Problem (Q2884530) (← links)
- Chained Lin-Kernighan for Large Traveling Salesman Problems (Q2884550) (← links)
- Tour Merging via Branch-Decomposition (Q2884557) (← links)
- Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP) (Q2892348) (← links)
- Numerically Safe Gomory Mixed-Integer Cuts (Q2899029) (← links)
- Solving Very Sparse Rational Systems of Equations (Q2989125) (← links)
- An Exact Rational Mixed-Integer Programming Solver (Q3009754) (← links)
- Safe Lower Bounds for Graph Coloring (Q3009768) (← links)
- Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem (Q3169103) (← links)
- A polynomial-time test for total dual integrality in fixed dimension (Q3221757) (← links)
- (Q3425132) (← links)
- Solution of a Large-Scale Traveling-Salesman Problem (Q3565230) (← links)
- Fifty-Plus Years of Combinatorial Integer Programming (Q3565241) (← links)
- A Study of Domino-Parity and k-Parity Constraints for the TSP (Q3596350) (← links)
- A Minimal Totally Dual Integral Defining System for the <i>b</i>-Matching Polyhedron (Q3669184) (← links)
- (Q3682243) (← links)
- On box totally dual integral polyhedra (Q3717741) (← links)
- Linear Systems for Constrained Matching Problems (Q3752421) (← links)
- Sensitivity theorems in integer linear programming (Q3793940) (← links)
- A Computational Study of the Job-Shop Scheduling Problem (Q4025904) (← links)
- An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming (Q4202587) (← links)
- (Q4283461) (← links)
- (Q4371290) (← links)
- (Q4411337) (← links)
- Computing Minimum-Weight Perfect Matchings (Q4427370) (← links)
- (Q4735941) (← links)
- In Pursuit of the Traveling Salesman (Q5891959) (← links)
- In Pursuit of the Traveling Salesman (Q5894461) (← links)
- Constrained Local Search for Last-Mile Routing (Q6387115) (← links)
- Fuchs' problem for small groups (Q6596269) (← links)
