On Transportation Problems with Upper Bounds on Leading Rectangles

DOI10.1137/0606048MaRDI QIDQ3718481zbMATHOpenAlexFDO

Authors 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

zbMATH Keywords

greedy algorithmgraph partitioningoptimal solutiontransportation problemsupper bounds on leading rectangles

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Programming involving graphs or networks (90C35) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 3970528
• A greedy algorithm for solving ordinary transportation problem with capacity constraints
• A simple greedy algorithm for a class of shuttle transportation problems
• scientific article; zbMATH DE number 1953188
• scientific article; zbMATH DE number 3904297

Cited in

(12)

• Staircase transportation problems with superadditive rewards and cumulative capacities
• An algorithm for the detection and construction of Monge sequences
• Laplacian eigenvalues and the maximum cut problem
• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
• A greedy algorithm for solving ordinary transportation problem with capacity constraints
• Monge and feasibility sequences in general flow problems
• A simple greedy algorithm for a class of shuttle transportation problems
• scientific article; zbMATH DE number 3904297 (Why is no real title available?)
• Perspectives of Monge properties in optimization
• Greedy concepts for network flow problems
• Maximizing the value of a space mission
• Recognition of overlap graphs

This page was built for publication: On Transportation Problems with Upper Bounds on Leading Rectangles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3718481)