A cutting plane algorithm for minimum perfect 2-matchings

Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Related Items

A polynomial-time solution to Papadimitriou and Steiglitz's ``traps, The symmetric travelling salesman problem. I: New fast lower bounds for the problem of optimal 2-matching, Multi-depot multiple TSP: a polyhedral study and computational results, Incorporating facet-inducing inequalities into graphical-construct-based Lagrangian relaxation methodologies, Facet identification for the symmetric traveling salesman polytope, Undirected postman problems with zigzagging option: a cutting-plane approach, On the transportation problem with market choice, Euclidean semi-matchings of random samples, Classical cuts for mixed-integer programming and branch-and-cut, Exploiting planarity in separation routines for the symmetric traveling salesman problem, Separation routine and extended formulations for the stable set problem in claw-free graphs, Solving the prize-collecting rural postman problem, Unnamed Item, Solution of large-scale symmetric travelling salesman problems

Cites Work