Polyhedral Results for 1-Restricted Simple 2-Matchings

DOI10.1137/070697409zbMATH Open1218.05133OpenAlexW2015084469MaRDI QIDQ3395008FDOQ3395008

Authors: Yanjun Li, David Hartvigsen 

Publication date: 20 August 2009

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070697409

Recommendations

• Polyhedron of triangle-free simple 2-matchings in subcubic graphs
• A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges
• Maximum cardinality 1-restricted simple 2-matchings
• Integer Programming and Combinatorial Optimization
• Matching Problems in Polymatroids Without Double Circuits
• Results and open problems in matchings in regular graphs
• A minimax result for perfect matchings of a polyomino graph
• Perfect matchings and \(K_{1,p}\)-restricted graphs
• Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem
• Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract)

zbMATH Keywords

combinatorial optimizationpolyhedral combinatoricstraveling salesman problemmatchings

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (5)

• Maximum cardinality 1-restricted simple 2-matchings
• Plastic number and possible optimal solutions for an Euclidean 2-matching in one dimension
• Restricted 2-factor polytopes
• Polyhedron of triangle-free simple 2-matchings in subcubic graphs
• Integer Programming and Combinatorial Optimization

This page was built for publication: Polyhedral Results for 1-Restricted Simple 2-Matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3395008)