scientific article; zbMATH DE number 4130203

MaRDI QIDQ3032099zbMATH OpenFDO

Authors B. Dorhout

Publication date 1989

zbMATH Keywords

directed graphminimum cost assignmentpostoptimal analysisshortest path

Mathematics Subject Classification ID

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

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

Cited in

(7)

• Minimum deviation problems
• A compact form of assignment of all nonexcessive paths in a digraph
• Using the least adjustment method to solve the assignment problem of the shortest time limit
• scientific article; zbMATH DE number 3889279 (Why is no real title available?)
• scientific article; zbMATH DE number 3916048 (Why is no real title available?)
• Threshold assignment algorithm
• scientific article; zbMATH DE number 515939 (Why is no real title available?)

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)