A note on shortest path, assignment, and transportation problems
From MaRDI portal
Publication:5336844
DOI10.1002/nav.3800100132zbMath0128.39504OpenAlexW2013479076MaRDI QIDQ5336844
Alan J. Hoffman, Harry M. Markowitz
Publication date: 1963
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800100132
Related Items (9)
A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability ⋮ Linear-Time Approximation for Maximum Weight Matching ⋮ Interdiction problems on planar graphs ⋮ A solvable case of the traveling salesman problem ⋮ Critical edges for the assignment problem: complexity and exact resolution ⋮ Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm ⋮ On the computational complexity of combinatorial flexibility problems ⋮ Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights ⋮ Complexity of the min-max and min-max regret assignment problems
This page was built for publication: A note on shortest path, assignment, and transportation problems
