Narrow search
Showing 1 - 7 of 7
Cover Image
Computing with Domino-Parity Inequalities for the Traveling Salesman Problem (TSP)
Cook, William; Espinoza, Daniel G.; Goycoolea, Marcos - In: INFORMS journal on computing : JOC 19 (2007) 3, pp. 356-365
Persistent link: https://www.econbiz.de/10007791965
Cover Image
Numerically Safe Gomory Mixed-Integer Cuts
Cook, William; Dash, Sanjeeb; Fukasawa, Ricardo; … - In: INFORMS journal on computing : JOC 21 (2009) 4, pp. 641-649
Persistent link: https://www.econbiz.de/10008326700
Cover Image
Tour Merging via Branch-Decomposition
Cook, William; Seymour, Paul - In: INFORMS journal on computing : JOC 15 (2003) 3, pp. 233-248
Persistent link: https://www.econbiz.de/10007104478
Cover Image
Chained Lin-Kernighan for Large Traveling Salesman Problems
Applegate, David; Cook, William; Rohe, André - In: INFORMS journal on computing : JOC 15 (2003) 1, pp. 82-92
Persistent link: https://www.econbiz.de/10007105939
Cover Image
Solution of a Min-Max Vehicle Routing Problem
Applegate, David; Cook, William; Dash, Sanjeeb; Rohe, André - In: INFORMS journal on computing : JOC 14 (2002) 2, pp. 132-143
Persistent link: https://www.econbiz.de/10007109515
Cover Image
Special Issue on Combinatorial Optimization and Network Flows - Computing Minimum-Weight Perfect Matchings
Cook, William; Rohe, André - In: INFORMS journal on computing : JOC 11 (1999) 2, pp. 138-148
Persistent link: https://www.econbiz.de/10007122749
Cover Image
Numerically safe Gomory mixed-integer cuts
Cook, William; Dash, Sanjeeb; Fukasawa, Ricardo; … - In: INFORMS journal on computing : JOC 21 (2009) 4, pp. 641-649
Persistent link: https://www.econbiz.de/10003909550