scientific article; zbMATH DE number 4197736

MaRDI QIDQ5202835zbMATH OpenFDO

Authors Michael J. Todd, John E. Mitchell

Publication date 1990

zbMATH Keywords

cutting-plane algorithmKarmarkar's algorithmmatching

Mathematics Subject Classification ID

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

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

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)