scientific article; zbMATH DE number 4197736

zbMATH Open0725.90055MaRDI QIDQ5202835FDOQ5202835

Authors: Michael J. Todd, John E. Mitchell 

Publication date: 1990

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

Recommendations

• Solving combinatorial optimization problems using Karmarkar's algorithm
• Algorithms for finding k-best perfect matchings
• Solving (large scale) matching problems combinatorially
• Solving matching problems with linear programming
• scientific article; zbMATH DE number 515943
• On \(k\)-match problems
• Solving matching problems efficiently in bipartite graphs
• Algorithms solving the matching cut problem
• Algorithms Solving the Matching Cut Problem

zbMATH Keywords

matchingcutting-plane algorithmKarmarkar's algorithm

Mathematics Subject Classification ID

Linear programming (90C05) Programming involving graphs or networks (90C35) Computational methods for problems pertaining to operations research and mathematical programming (90-08) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited In (2)

• Solving combinatorial optimization problems using Karmarkar's algorithm
• Solving matching problems with linear programming

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 Q5202835)