scientific article; zbMATH DE number 515939

From MaRDI portal

Revision as of 18:29, 6 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4283456

Jump to:navigation, search

zbMath0797.90022MaRDI QIDQ4283456

George Kocur, Jianxiu Hao

Publication date: 1993

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

algorithm bipartite graph assignment problem augmenting path integer-valued cost

Mathematics Subject Classification ID

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

Related Items (2)

Linear and semi-assignment problems: A core oriented approach ⋮ Linear assignment procedures

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4283456&oldid=18207808"