| Publication | Date of Publication | Type |
|---|
Quantum annealing versus digital computing. An experimental comparison
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Optimal patchings for consecutive ones matrices
Mathematical Programming Computation | 2022-04-14 | Paper |
Computational approaches to MAX-cut
International Series in Operations Research & Management Science | 2016-04-26 | Paper |
Lifting and separation procedures for the cut polytope
Mathematical Programming. Series A. Series B | 2014-08-29 | Paper |
A heuristic and an exact method for the gate matrix connection cost minimization problem
International Transactions in Operational Research | 2013-11-14 | Paper |
Exact ground states of two-dimensional \(\pm J\) Ising spin glasses
Journal of Statistical Physics | 2013-04-10 | Paper |
SpeeDP: an algorithm to compute SDP bounds for very large max-cut instances
Mathematical Programming. Series A. Series B | 2012-12-19 | Paper |
Traces of the XII Aussois Workshop on combinatorial optimization
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Terse integer linear programs for Boolean optimization
| 2009-10-12 | Paper |
Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
SIAM Journal on Optimization | 2008-12-05 | Paper |
The Symmetric Traveling Salesman Polytope: New Facets from the Graphical Relaxation
Mathematics of Operations Research | 2008-05-27 | Paper |
A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Exact ground states of Ising spin glasses: new experimental results with a branch-and-cut algorithm
Journal of Statistical Physics | 2006-08-23 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
New approaches for optimizing over the semimetric polytope
Mathematical Programming. Series A. Series B | 2005-12-14 | Paper |
scientific article; zbMATH DE number 2196278 (Why is no real title available?)
| 2005-08-22 | Paper |
scientific article; zbMATH DE number 2159019 (Why is no real title available?)
| 2005-04-19 | Paper |
scientific article; zbMATH DE number 2119671 (Why is no real title available?)
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 2119756 (Why is no real title available?)
| 2004-11-29 | Paper |
scientific article; zbMATH DE number 2084781 (Why is no real title available?)
| 2004-08-09 | Paper |
On the cut polyhedron.
Discrete Mathematics | 2004-03-14 | Paper |
Minimizing breaks by maximizing cuts.
Operations Research Letters | 2003-08-13 | Paper |
Primal separation for 0/1 polytopes
Mathematical Programming. Series A. Series B | 2003-07-13 | Paper |
scientific article; zbMATH DE number 1947419 (Why is no real title available?)
| 2003-07-08 | Paper |
The mathematics of playing golf, or: A new class of difficult nonlinear mixed integer programs
Mathematical Programming. Series A. Series B | 2002-12-01 | Paper |
scientific article; zbMATH DE number 1749222 (Why is no real title available?)
| 2002-01-01 | Paper |
Practical performance of efficient minimum cut algorithms
Algorithmica | 2000-03-19 | Paper |
scientific article; zbMATH DE number 1175953 (Why is no real title available?)
| 1998-07-19 | Paper |
The Graphical Asymmetric Traveling Salesman Polyhedron: Symmetric Inequalities
SIAM Journal on Discrete Mathematics | 1997-06-30 | Paper |
A branch-and-cut algorithm for the equicut problem
Mathematical Programming. Series A. Series B | 1997-01-01 | Paper |
scientific article; zbMATH DE number 795217 (Why is no real title available?)
| 1996-03-05 | Paper |
The graphical relaxation: A new framework for the symmetric traveling salesman polytope
Mathematical Programming. Series A. Series B | 1993-06-29 | Paper |
The Crown Inequalities for the Symmetric Traveling Salesman Polytope
Mathematics of Operations Research | 1993-01-16 | Paper |
The symmetric traveling salesman polytope and its graphical relaxation: Composition of valid inequalities
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
SIAM Review | 1991-01-01 | Paper |
Facet identification for the symmetric traveling salesman polytope
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
Scheduling tasks with sequence-dependent processing times
| 1988-01-01 | Paper |
Branch-and-cut approach to a variant of the traveling salesman problem
Journal of Guidance, Control, and Dynamics | 1988-01-01 | Paper |
A function space approach to the foundations of system theory
International Journal of Systems Science. Principles and Applications of Systems and Integration | 1983-01-01 | Paper |
