| Publication | Date of Publication | Type |
|---|
Unconstrained traveling tournament problem is APX-complete
Operations Research Letters | 2023-09-12 | Paper |
A detailed introduction to a minimum-cost perfect matching algorithm based on linear programming
Journal of Combinatorial Optimization | 2023-04-17 | Paper |
Nonexistence Certificates for Ovals in a Projective Plane of Order Ten
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Revisiting a cutting-plane method for perfect matchings
OJMO. Open Journal of Mathematical Optimization | 2022-08-20 | Paper |
| A SAT-based Resolution of Lam's Problem | 2020-12-08 | Paper |
A nonexistence certificate for projective planes of order ten with weight 15 codewords
Applicable Algebra in Engineering, Communication and Computing | 2020-07-15 | Paper |
| Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem | 2020-01-31 | Paper |
Unsatisfiability Proofs for Weight 16 Codewords in Lam's Problem
(available as arXiv preprint) | 2020-01-01 | Paper |
A SAT-based Resolution of Lam's Problem
(available as arXiv preprint) | 2020-01-01 | Paper |
Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions
Advances in Operations Research | 2018-05-11 | Paper |
| Improved approximation of layout problems on random graphs | 2017-10-27 | Paper |
Verifying integer programming results
(available as arXiv preprint) | 2017-08-31 | Paper |
Improved approximation of layout problems on random graphs
(available as arXiv preprint) | 2017-01-01 | Paper |
| On Burdet and Johnson's Algorithm for Integer Programming | 2014-10-28 | Paper |
On Burdet and Johnson's Algorithm for Integer Programming
(available as arXiv preprint) | 2014-01-01 | Paper |
Revisiting a simple algorithm for the planar multiterminal cut problem
Operations Research Letters | 2010-09-07 | Paper |
A Benders approach for computing lower bounds for the mirrored traveling tournament problem
Discrete Optimization | 2009-05-07 | Paper |
Maximal planar graphs of inscribable type and diagonal flips
Discrete Mathematics | 2009-04-09 | Paper |
The equivalence of semidefinite relaxations of polynomial 0-1 and 1 programs via scaling
Operations Research Letters | 2008-09-10 | Paper |
Computation of the Lasserre Ranks of Some Polytopes
Mathematics of Operations Research | 2008-05-27 | Paper |
Solving mirrored traveling tournament problem benchmark instances with eight teams
Discrete Optimization | 2008-05-16 | Paper |
Facets of the independent path-matching polytope
Discrete Optimization | 2006-10-10 | Paper |
On Lovász--Schrijver Lift-and-Project Procedures on the Dantzig--Fulkerson--Johnson Relaxation of the TSP
SIAM Journal on Optimization | 2006-05-30 | Paper |
Optimal 3-terminal cuts and linear programming
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
