scientific article; zbMATH DE number 89415

MaRDI QIDQ4016840zbMATH OpenFDO

Authors Wojciech Sikora

Publication date 16 January 1993

zbMATH Keywords

branch-and- boundquadratic cost functiontransportation-production problem

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Transportation, logistics and supply chain management (90B06) Production models (90B30) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
• A relaxation-strategy-based modification branch-and-bound algorithm for solving a class of transportation-production problems
• scientific article; zbMATH DE number 4185400
• A Lagrangian based branch-and-bound algorithm for production-transportation problems
• Strongly polynomial algorithm for a production-transportation problem with concave production cost

Cited in

(7)

• A branch and bound procedure for cost minimizing bulk transportation problem
• A relaxation-strategy-based modification branch-and-bound algorithm for solving a class of transportation-production problems
• scientific article; zbMATH DE number 3873082 (Why is no real title available?)
• A dual tailored branch-and-bound algorithm for quadratic mixed-integer problems. Applied to production models with buffers
• A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST
• scientific article; zbMATH DE number 4185400 (Why is no real title available?)
• A Lagrangian based branch-and-bound algorithm for production-transportation problems

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