Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

scientific article; zbMATH DE number 4130203

From MaRDI portal
Jump to:navigation, search

zbMATH Open0689.90070MaRDI QIDQ3032099FDOQ3032099


Authors: B. Dorhout Edit this on Wikidata


Publication date: 1989



Title of this publication is not available (Why is that?)



Recommendations

  • A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
  • scientific article; zbMATH DE number 5039783
  • A shortest augmenting path algorithm for dense and sparse linear assignment problems
  • scientific article; zbMATH DE number 176471
  • Threshold assignment algorithm


zbMATH Keywords

shortest pathdirected graphpostoptimal analysisminimum cost assignment


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25)



Cited In (6)

  • Title not available (Why is that?)
  • Threshold assignment algorithm
  • Title not available (Why is that?)
  • Using the least adjustment method to solve the assignment problem of the shortest time limit
  • Title not available (Why is that?)
  • Minimum deviation problems





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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3032099&oldid=16078067"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 3 February 2024, at 21:39. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki