Separating clique trees and bipartition inequalities having a fixed number of handles and teeth in polynomial time

Polynomial-Time Separation of Simple Comb Inequalities

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization

TSP Cuts Which Do Not Conform to the Template Paradigm

Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]

Polynomial-Time Separation of a Superclass of Simple Comb Inequalities

Mathematics of Operations Research

Rapidly solving an online sequence of maximum flow problems with extensions to computing robust minimum cuts

CPAIOR'08 Proceedings of the 5th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems

Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem

Mathematics of Operations Research

Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem

Mathematics of Operations Research

Exploiting planarity in separation routines for the symmetric traveling salesman problem

Discrete Optimization