scientific article; zbMATH DE number 515943

zbMath0788.90059MaRDI QIDQ4283461

David L. Applegate, William Cook

Publication date: 15 May 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

large-scale graphsEdmonds' blossom algorithmminimum weight perfect matchings

Mathematics Subject Classification ID

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

Related Items

Solving large-scale TSP using a fast wedging insertion partitioning approach, On variable-weighted exact satisfiability problems, Blossom V: A new implementation of a minimum cost perfect matching algorithm, A \(2/3\)-approximation algorithm for vertex-weighted matching, Computing in combinatorial optimization, Covering minimum spanning trees of random subgraphs, IntraClusTSP -- an incremental intra-cluster refinement heuristic algorithm for symmetric travelling salesman problem, A new variant of a vehicle routing problem: Lower and upper bounds