scientific article; zbMATH DE number 515939

MaRDI QIDQ4283456zbMATH OpenFDO

Authors Jianxiu Hao, George Kocur

Publication date 1993

zbMATH Keywords

algorithmassignment problemaugmenting pathbipartite graphinteger-valued cost

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Deterministic network models in operations research (90B10) Combinatorial optimization (90C27)

Recommendations

• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• An in-core/out-of-core method for solving large scale assignment problems
• scientific article; zbMATH DE number 176471
• scientific article; zbMATH DE number 4130203

Cited in

(9)

• An addendum on the incremental assignment problem
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• The -assignment problems
• Linear assignment procedures
• Linear and semi-assignment problems: A core oriented approach
• An in-core/out-of-core method for solving large scale assignment problems
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• A parallel shortest augmenting path algorithm for the assignment problem
• Geometric algorithms for the minimum cost assignment problem

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