scientific article; zbMATH DE number 1286488

zbMATH Open0921.90120MaRDI QIDQ4242935FDOQ4242935

Authors: T. V. Dergunova, R. Yu. Simanchev 

Publication date: 11 May 1999

Title of this publication is not available (Why is that?)

Recommendations

• The clique partitioning problem: Facets and patching facets
• Approximation algorithms for \(k\)-connected graph factors
• Connected factors in graphs -- a survey
• Cliques in \(k\)-connected graphs
• The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations
• Approximation and exact algorithms for special cases of connected \(f\)-factors
• Embedding clique-factors in graphs with low \(\ell\)-independence number
• Facets of the clique partitioning polytope
• Connected \([k,k+1]\)-factors of graphs
• Clique-Web Facets for Multicut Polytopes

zbMATH Keywords

travelling salesman problemoptimal matching

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication:

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