scientific article; zbMATH DE number 912072

zbMATH0853.90088MaRDI QIDQ4886440FDOQ4886440

Authors A. A. Zaslavskii, S. S. Lebedev

Publication date 6 January 1997

zbMATH Keywords

branch-and-boundinteger generalized transportation

Mathematics Subject Classification ID

Integer programming (90C10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• scientific article; zbMATH DE number 3847213
• Some branch-and-bound procedures for fixed-cost transportation problems
• A branch and bound procedure for cost minimizing bulk transportation problem
• New method for finding an optimal solution of fully interval integer transportation problems
• Solution of constrained generalized transportation problems using the pivot and probe algorithm
• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points
• A Branch-and-Bound Method for the Fixed Charge Transportation Problem
• Solving generalized transportation problems via pure transportation problems
• Transportation problem with nonlinear side constraints a branch and bound approach
• A Lagrangian based branch-and-bound algorithm for production-transportation problems

Cited in

(1)

• A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points

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 Q4886440)