scientific article; zbMATH DE number 4199652

zbMATH Open0726.68062MaRDI QIDQ3348434FDOQ3348434

Authors: Kathie Cameron, Jack Edmonds 

Publication date: 1990

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

Recommendations

• Polyhedral proof methods in combinatorial optimization
• On cutting-plane proofs in combinatorial optimization
• scientific article; zbMATH DE number 16720
• scientific article; zbMATH DE number 3904331
• scientific article; zbMATH DE number 4083375

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete mathematics in relation to computer science (68R99) Graph theory (05C99)

Cited In (14)

• On existence theorems
• Colouring Some Classes of Perfect Graphs Robustly
• On finding another room-partitioning of the vertices
• Criss-cross methods: A fresh view on pivot algorithms
• Coloring vertices of a graph or finding a Meyniel obstruction
• EP theorem for dual linear complementarity problems
• A polynomial path-following interior point algorithm for general linear complementarity problems
• Coloured matchings in bipartite graphs
• Balanced matrices
• The s-monotone index selection rule for criss-cross algorithms of linear complementarity problems
• Exponentiality of the exchange algorithm for finding another room-partitioning
• Some graphic uses of an even number of odd nodes
• EP theorems and linear complementarity problems
• On balanced graphs

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