On Transportation Problems with Upper Bounds on Leading Rectangles

DOI10.1137/0606048zbMATH Open0589.90056OpenAlexW1995441663MaRDI QIDQ3718481FDOQ3718481

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Greedy concepts for network flow problems
• Monge and feasibility sequences in general flow problems
• Recognition of overlap graphs
• The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
• Title not available (Why is that?)
• An algorithm for the detection and construction of Monge sequences
• A simple greedy algorithm for a class of shuttle transportation problems
• Laplacian eigenvalues and the maximum cut problem
• Staircase transportation problems with superadditive rewards and cumulative capacities
• Perspectives of Monge properties in optimization
• Maximizing the value of a space mission

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)