A general deterministic pivot method for oriented matroid programming

MaRDI QIDQ1207255zbMATH OpenFDO

Authors Zhemin Wang

Publication date 1 April 1993

Published in Chinese Annals of Mathematics. Series B (Search for Journal in Brave)

zbMATH Keywords

oriented matroid programmingcriss-cross algorithmpivot method

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• A finite conformal-elimination free algorithm over oriented matroid programming
• A finite crisscross method for oriented matroids
• scientific article; zbMATH DE number 4027490
• scientific article; zbMATH DE number 3985244
• scientific article; zbMATH DE number 4106867

Cited in

(8)

• A finite crisscross method for oriented matroids
• Criss-cross methods: A fresh view on pivot algorithms
• A finite conformal-elimination free algorithm over oriented matroid programming
• scientific article; zbMATH DE number 4027490 (Why is no real title available?)
• scientific article; zbMATH DE number 4106867 (Why is no real title available?)
• scientific article; zbMATH DE number 3985244 (Why is no real title available?)
• scientific article; zbMATH DE number 4185398 (Why is no real title available?)
• Computing and proving with pivots

This page was built for publication: A general deterministic pivot method for oriented matroid programming

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1207255)