Restricted 2-factor polytopes

DOI10.1007/s101079900110zbMath0971.90070OpenAlexW1516152095MaRDI QIDQ1970297

William H. Cunningham, Yaoguang Wang

Publication date: 6 November 2001

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/11858/00-001M-0000-0014-9F73-8

zbMATH Keywords

undirected graphsymmetric travelling salesman problemevery node

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (6)

A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs ⋮ A Branch-and-Price Algorithm for Solving the Hamiltonian p-Median Problem ⋮ Polyhedron of triangle-free simple 2-matchings in subcubic graphs ⋮ Match twice and stitch: a new TSP tour construction heuristic. ⋮ Finding maximum square-free 2-matchings in bipartite graphs ⋮ Unnamed Item

This page was built for publication: Restricted 2-factor polytopes