scientific article; zbMATH DE number 4199652

MaRDI QIDQ3348434zbMATH OpenFDO

Authors Kathie Cameron, Jack Edmonds

Publication date 1990

Mathematics Subject Classification ID

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

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

Cited in

(14)

• On existence theorems
• Colouring Some Classes of Perfect Graphs Robustly
• Coloring vertices of a graph or finding a Meyniel obstruction
• Criss-cross methods: A fresh view on pivot algorithms
• On finding another room-partitioning of the vertices
• 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)