|
William Cook Home Page Papers Draft of Chapter 7 (Dynamic Programming) for the planned book A Practical Guide to Discrete Optimization, with D. Applegate, S. Dash, D. S. Johnson. December 29, 2014. Draft of Chapter 1 (The Setting) for the planned book A Practical Guide to Discrete Optimization, with D. Applegate, S. Dash, D. S. Johnson. August 7, 2014. A hybrid branch-and-bound approach for exact rational mixed-integer programming, with T. Koch, D. E. Steffy, K. Wolter, Mathematical Programming Computation 5 (2013) 305--344. Local cuts for mixed-integer programming, with V. Chvatal and D. Espinoza, Mathematical Programming Computation 5 (2013) 171--200. Maximum-weight stable sets and safe lower bounds for graph coloring, with S. Held, E. C. Sewell, Mathematical Programming Computation 4 (2012) 363--381. An exact rational mixed-integer programming solver, with T. Koch, D. E. Steffy, K. Wolter, in Integer Progamming and Combinatorial Optimization, IPCO 2011, O. Gunluk, G. Woeginger, eds. Lecture Notes in Computer Science 6655, pp. 104--116. Safe lower bounds for graph coloring, with S. Held, E. C. Sewell, in Integer Progamming and Combinatorial Optimization, IPCO 2011, O. Gunluk, G. Woeginger, eds. Lecture Notes in Computer Science 6655, pp. 261--273. Solving very sparse rational systems of equations, with D. Steffy, Transactions on Mathematical Software, Volume 37, Issue 4, February 2011. doi:10.1145/1916461.1916463. Generalized domino-parity inequalities for the TSP, with D. Espinoza and M. Goycoolea, Mathematics of Operations Research 35 (2010) 479--493. doi:10.1287/moor.1100.0451. Fifty-plus years of combinatorial integer programming, in 50 Years of Integer Programming 1958--2008, M. Juenger et al., editors. Springer, 2010, pp. 387--430 Numerically safe Gomory mixed-integer cuts, with S. Dash, R. Fukasawa, and M. Goycoolea, INFORMS Journal on Computing 21 (2009) 641--649. doi:10.1287/ijoc.1090.0324. Certification of an optimal TSP tour through 85,900 cities, with D. Applegate, R. Bixby, V. Chvatal, D. Espinoza, M. Goycoolea, and K. Helsgaun, Operations Research Letters 37 (2009) 11--15. doi:10.1016/j.orl.2008.09.006. Mathematical Programming Computation: A new MPS journal, with T. Koch, Optima 78 (2008), pages 1, 7, 8, and 11. Exact solutions to linear programming problems, with D. Applegate, S. Dash, and D. Espinoza, Operations Research Letters 35 (2007) 693--699. doi:10.1016/j.orl.2006.12.010. Computing with domino-parity inequalities for the TSP, with D. Espinoza and M. Goycoolea, INFORMS Journal on Computing 19 (2007) 356--365. rh_tsp_map 3.0: End-to-end radiation hybrid mapping with improved speed and quality control, with A. Schaeffer, E. Rice, and R. Agarwala, Bioinformatics 23 (2007) 1156--1158. Vasek Chvatal: A very short introduction, with D. Avis, A. Bondy, and B. Reed, Graphs and Combinatorics 23-Supplement (2007) 41--65. Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems, with D. Applegate, R. Bixby, and V. Chvatal, Mathematical Programming (Series B) 97 (2003) 91--153. Tour merging via branch-decomposition, with P. Seymour, INFORMS Journal on Computing 15 (2003) 233--248. Chained Lin-Kernighan for large traveling salesman problems, with D. Applegate and A. Rohe, INFORMS Journal on Computing 15 (2003) 82--92. Solution of a min-max vehicle routing problem, with D. Applegate, S. Dash, and A. Rohe, INFORMS Journal on Computing 14 (2002) 132--143. TSP cuts which do not conform to the template paradigm, with D. Applegate, R. Bixby, and V. Chvatal, in Computational Combinatorial Optimization, M. Juenger and D. Naddef, editors. Springer, 2001, pp. 261--304. On the matrix-cut rank of polyhedra, with S. Dash, Mathematics of Operations Research 26 (2001) 19--30. Computing minimum-weight perfect matchings, with A. Rohe, INFORMS Journal on Computing 11 (1999) 138--148. Computational experience with parallel mixed integer programming in a distributed environment, with R. Bixby, A. Cox, and E. Lee, Annals of Operations Research 90 (1999) 19--43. On the solution of traveling salesman problems, with D. Applegate, R. Bixby, and V. Chvatal, Documenta Mathematica Journal der Deutschen Mathematiker-Vereinigung, International Congress of Mathematicians (1998) 645--656. An implementation of the generalized basis reduction algorithm for integer programming, with T. Rutherford, H.E. Scarf, and D. Shallcross, ORSA Journal on Computing 5 (1993) 206--212. Solving large-scale matching problems, with D. Applegate, in Algorithms for Network Flows and Matching, D.S. Johnson and C.C. McGeoch, editors (American Mathematical Society, 1993), pp. 557--576. On integer points in polyhedra, with M. Hartmann, R. Kannan, and C. McDiarmid, Combinatorica 12 (1992) 27--37. A computational study of the job-shop scheduling problem, with D. Applegate, ORSA Journal on Computing 3 (1991) 149--156. Integral infeasibility and testing total dual integrality, with D.L. Applegate and S.T. McCormick, Operations Research Letters 10 (1991) 37--41. The discipline number of a graph, with V. Chvatal, Discrete Applied Mathematics 86 (1990) 191--198. Cutting-plane proofs in polynomial space, Mathematical Programming 47 (1990) 11--18. On the complexity of branch and cut methods for the traveling salesman problem, with M. Hartmann, in Polyhedral Combinatorics, W. Cook and Paul Seymour, editors (American Mathematical Society, 1990), 75--82. Chvatal closures for mixed integer programming problems, with R. Kannan and A. Schrijver, Mathematical Programming 47 (1990) 155--174. On cutting-plane proofs in combinatorial optimization, with V. Chvatal and M. Hartmann, Linear Algebra and Its Applications 114/115 (1989) 455--499. Linear systems for constrained matching problems, with W.R. Pulleyblank, Mathematics of Operations Research 12 (1987) 97--120. On the complexity of cutting-plane proofs, with C. Coullard and Gy. Turan, Discrete Applied Mathematics 18 (1987) 25--38. On box totally dual integral polyhedra, Mathematical Programming 34 (1986) 48--61. An integer analogue of Caratheodory's theorem, with J. Fonlupt and A. Schrijver, Journal of Combinatorial Theory (Series B) 40 (1986) 63--70. Sensitivity theorems in integer linear programming, with A.M.H. Gerards, A. Schrijver, and E. Tardos, Mathematical Programming 34 (1986) 252--264. A note on matchings and separability, Discrete Applied Mathematics 10 (1985) 202--209. A polynomial-time test for total dual integrality in fixed dimension, with L. Lovasz and A. Schrijver, Mathematical Programming Study 22 (1984) 64--69. A minimal totally dual integral defining system for the b-matching polyhedron, SIAM Journal of Algebraic and Discrete Methods 4 (1983) 221--230. Operations that preserve total dual integrality, Operations Research Letters 2 (1983) 31--35. Technical Reports A study of domino-parity and k-parity constraints for the TSP, with D. Espinoza and M. Goycoolea, IPCO 2005, Lecture Notes in Computer Science 3509 (2005) 452--467. A parallel cutting-plane algorithm for the vehicle routing problem with time windows, with J.L. Rich, Technical Report, Rice University, 1999. Finding cuts in the TSP (A preliminary report), with D. Applegate, R. Bixby, and V. Chvatal, DIMACS Technical Report 95-05, Rutgers University, 1995. Ph.D. Thesis On Some Aspects of Totally Dual Integral Systems, Department of Combinatorics and Optimization, University of Waterloo, 1983. |
|