| Publication | Date of Publication | Type |
|---|
Fuchs' problem for small groups
Involve | 2024-09-02 | Paper |
| Constrained Local Search for Last-Mile Routing | 2021-12-30 | Paper |
Solving very sparse rational systems of equations
ACM Transactions on Mathematical Software | 2017-05-19 | Paper |
| In Pursuit of the Traveling Salesman | 2014-12-03 | Paper |
A hybrid branch-and-bound approach for exact rational mixed-integer programming
Mathematical Programming Computation | 2014-10-06 | Paper |
Local cuts for mixed-integer programming
Mathematical Programming Computation | 2013-08-05 | Paper |
Markowitz and Manne + Eastman + Land and Doig = branch and bound
Documenta Mathematica | 2013-04-17 | Paper |
Maximum-weight stable sets and safe lower bounds for graph coloring
Mathematical Programming Computation | 2013-04-10 | Paper |
Numerically safe Gomory mixed-integer cuts
INFORMS Journal on Computing | 2012-07-28 | Paper |
Computing with domino-parity inequalities for the traveling salesman problem (TSP)
INFORMS Journal on Computing | 2012-06-18 | Paper |
Chained Lin-Kernighan for large traveling salesman problems
INFORMS Journal on Computing | 2012-05-30 | Paper |
Solution of a min-max vehicle routing problem
INFORMS Journal on Computing | 2012-05-30 | Paper |
Tour merging via branch-decomposition
INFORMS Journal on Computing | 2012-05-30 | Paper |
| In pursuit of the traveling salesman. Mathematics at the limits of computation | 2012-01-17 | Paper |
An exact rational mixed-integer programming solver
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Safe lower bounds for graph coloring
Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
Generalized domino-parity inequalities for the symmetric traveling salesman problem
Mathematics of Operations Research | 2011-04-27 | Paper |
Fifty-plus years of combinatorial integer programming
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
Solution of a large-scale traveling-salesman problem
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
Certification of an optimal TSP tour through 85,900 cities
Operations Research Letters | 2009-02-23 | Paper |
Exact solutions to linear programming problems
Operations Research Letters | 2008-01-21 | Paper |
A Study of Domino-Parity and k-Parity Constraints for the TSP
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday)
Graphs and Combinatorics | 2007-07-19 | Paper |
| The traveling salesman problem. A computational study. | 2007-03-05 | Paper |
| scientific article; zbMATH DE number 2084783 (Why is no real title available?) | 2004-08-09 | Paper |
Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems
Mathematical Programming. Series A. Series B | 2003-09-01 | Paper |
| scientific article; zbMATH DE number 1947373 (Why is no real title available?) | 2003-07-08 | Paper |
On the matrix-cut rank of polyhedra.
Mathematics of Operations Research | 2001-11-26 | Paper |
Computational experience with parallel mixed integer programming in a distributed environment
Annals of Operations Research | 1999-12-02 | Paper |
Computing Minimum-Weight Perfect Matchings
INFORMS Journal on Computing | 1999-01-01 | Paper |
On the solution of traveling salesman problems
Documenta Mathematica | 1998-08-06 | Paper |
On the solution of traveling salesman problems
Documenta Mathematica | 1998-08-06 | Paper |
| scientific article; zbMATH DE number 1102774 (Why is no real title available?) | 1998-01-12 | Paper |
| scientific article; zbMATH DE number 515943 (Why is no real title available?) | 1994-05-15 | Paper |
An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming
ORSA Journal on Computing | 1994-01-03 | Paper |
A Computational Study of the Job-Shop Scheduling Problem
ORSA Journal on Computing | 1993-02-18 | Paper |
The discipline number of a graph
Discrete Mathematics | 1992-06-25 | Paper |
Cutting-plane proofs in polynomial space
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
Integral infeasibility and testing total dual integrality
Operations Research Letters | 1991-01-01 | Paper |
Chvátal closures for mixed integer programming problems
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Linear Systems for Constrained Matching Problems
Mathematics of Operations Research | 1987-01-01 | Paper |
On the complexity of cutting-plane proofs
Discrete Applied Mathematics | 1987-01-01 | Paper |
Sensitivity theorems in integer linear programming
Mathematical Programming | 1986-01-01 | Paper |
An integer analogue of Carathéodory's theorem
Journal of Combinatorial Theory. Series B | 1986-01-01 | Paper |
On box totally dual integral polyhedra
Mathematical Programming | 1986-01-01 | Paper |
A note on matchings and separability
Discrete Applied Mathematics | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3904333 (Why is no real title available?) | 1985-01-01 | Paper |
A polynomial-time test for total dual integrality in fixed dimension
Mathematical Programming Studies | 1984-01-01 | Paper |
Operations that preserve total dual integrality
Operations Research Letters | 1983-01-01 | Paper |
A Minimal Totally Dual Integral Defining System for the b-Matching Polyhedron
SIAM Journal on Algebraic Discrete Methods | 1983-01-01 | Paper |
