A cutting plane algorithm for minimum perfect 2-matchings

Polynomial-Time Separation of Simple Comb Inequalities

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

Undirected postman problems with zigzagging option: A cutting-plane approach

Computers and Operations Research

The Clustered Prize-Collecting Arc Routing Problem

Transportation Science

The symmetric travelling salesman problem I. New fast lower bounds for the problem of optimal 2-matching

Automation and Remote Control

The Windy Clustered Prize-Collecting Arc-Routing Problem

Transportation Science

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms

Exploiting planarity in separation routines for the symmetric traveling salesman problem

Discrete Optimization

Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies

Operations Research Letters