scientific article; zbMATH DE number 4131951

MaRDI QIDQ3033559zbMATH OpenFDO

Authors

Publication date 1988

zbMATH Keywords

three-dimensional time minimizing assignmenttwo-dimensional bottleneck transportation

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10)

Recommendations

• The three dimensional bottleneck assignment problem and its variants
• Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
• An algorithm for the optimum time-cost trade-off in three dimensional transportation problem
• Time‐minimizing transportation problems
• Time-cost tradeoff in a three-dimensional assignment problem

Cited in

(7)

• Time-cost tradeoff in a three-dimensional assignment problem
• The three-dimensional bottleneck assignment problem with capacity constraints
• Specially Structured Precedence Constraints in Three-Dimensional Bottleneck Assignment Problems
• Three dimensional bounded transportation problem
• The three dimensional bottleneck assignment problem and its variants
• Efficient algorithms for three‐dimensional axial and planar random assignment problems
• On Asymptotically Optimal Algorithm for One Modification of Planar 3-dimensional Assignment Problem

This page was built for publication:

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