Network flow problem with carrier

MaRDI QIDQ3610739zbMATH OpenFDO

Authors Ting Lei, Enyu Yao

Publication date 6 March 2009

zbMATH Keywords

heuristicLagrangian relaxationmixed integer programmingnetwork simplex method

Mathematics Subject Classification ID

Mixed integer programming (90C11) Programming involving graphs or networks (90C35)

Recommendations

• The Capacitated Carrier Transportation Problem: An Application of the Axial Three-Dimensional Transportation Problem with Heuristic
• Linear integer programming model and method for solving car-carrier loading problems
• Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints
• scientific article; zbMATH DE number 5990494
• Bicriterial total cost-maximal transportation time minimization network flow problem

Cited in

(2)

• Problem of groupage cargo routing in the multicommodity transport network with given tariffs and delivery time constraints
• The Capacitated Carrier Transportation Problem: An Application of the Axial Three-Dimensional Transportation Problem with Heuristic

This page was built for publication: Network flow problem with carrier

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