Transportation problems which can be solved by the use of Hirsch-paths for the dual problems

Authors:
Peter Kleinschmidt;Carl W. Lee;Heinz Schannath
Affiliations:
Univ. Passau, Passau, W. Germany;Univ. of Kentucky, Lexington;Ruhr-Univ. Bochum, Bochum, W. Germany
Venue:
Mathematical Programming: Series A and B
Year:
1987

Citing 0
Cited 4

Fast chromosome karyotyping by auction algorithm

International Journal of Bioinformatics Research and Applications
Using combinatorial optimization in model-based trimmed clustering with cardinality constraints

Computational Statistics & Data Analysis
Worst case examples of an exterior point algorithm for the assignment problem

Discrete Optimization
Sparse dual transportation polyhedra: Extreme points and signatures

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract