Persistency in the assignment and transportation problems

DOI10.1007/BF01194399MaRDI QIDQ1298743zbMATH OpenFDO

Authors Katarina Cechlárová

Publication date 22 August 1999

Published in Mathematical Methods of Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01194399

zbMATH Keywords

assignment problempersistencytransportation

Mathematics Subject Classification ID

Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming involving graphs or networks (90C35)

Recommendations

• Persistency in maximum cardinality bipartite matchings
• The -assignment problems
• Persistency in combinatorial optimization problems on matroids

Cites work

• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• Persistency in maximum cardinality bipartite matchings
• Rank of maximum matchings in a graph

Cited in

(7)

• Persistency and matroid intersection
• Persistency in maximum cardinality bipartite matchings
• Safety in s-t paths, trails and walks
• Some aspects on solving transportation problem
• Persistency in combinatorial optimization problems on matroids
• Genome assembly, from practice to theory: safe, complete and \textit{linear-time}
• Genome assembly, from practice to theory: safe, complete and linear-time

This page was built for publication: Persistency in the assignment and transportation problems

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