A note on shortest path, assignment, and transportation problems
From MaRDI portal
Publication:5336844
DOI10.1002/nav.3800100132zbMath0128.39504MaRDI 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
A solvable case of the traveling salesman problem, A lower bound on the expected optimal value of certain random linear programs and application to shortest paths in directed acyclic graphs and reliability, Complexity of the min-max and min-max regret assignment problems, Interdiction problems on planar graphs, Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights, Most vital vertices for the shortest \(s-t\) path problem: complexity and branch-and-cut algorithm, Critical edges for the assignment problem: complexity and exact resolution, On the computational complexity of combinatorial flexibility problems, Linear-Time Approximation for Maximum Weight Matching