On Transportation Problems with Upper Bounds on Leading Rectangles
From MaRDI portal
Publication:3718481
DOI10.1137/0606048zbMath0589.90056OpenAlexW1995441663MaRDI QIDQ3718481
Alan J. Hoffman, Earl R. Barnes
Publication date: 1985
Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0606048
transportation problemsgreedy algorithmgraph partitioningoptimal solutionupper bounds on leading rectangles
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Linear programming (90C05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Greedy concepts for network flow problems, Maximizing the value of a space mission, An algorithm for the detection and construction of Monge sequences, Perspectives of Monge properties in optimization, Recognition of overlap graphs, Monge and feasibility sequences in general flow problems, The performance of an eigenvalue bound on the max-cut problem in some classes of graphs, Laplacian eigenvalues and the maximum cut problem, Staircase transportation problems with superadditive rewards and cumulative capacities
Cites Work
