A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST

DOI10.15807/JORSJ.48.97MaRDI QIDQ5694060zbMATH OpenOpenAlexFDO

Authors Hidetoshi Nagai, Takahito Kuno

Publication date 29 September 2005

Published in Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL https://doi.org/10.15807/jorsj.48.97

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Production models (90B30) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• scientific article; zbMATH DE number 89415
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
• An algorithm for a concave production cost network flow problem
• A Lagrangian based branch-and-bound algorithm for production-transportation problems
• A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem

Cited in

(13)

• An algorithm for a concave production cost network flow problem
• A pseudo-polynomial primal-dual algorithm for globally solving a production-transportation problem
• A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem
• A strongly polynomial algorithm for a concave production-transportation problem with a fixed number of nonlinear variables
• A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems
• A relaxation-strategy-based modification branch-and-bound algorithm for solving a class of transportation-production problems
• An iterative algorithm for two level hierarchical time minimization transportation problem
• Tabu search and lower bounds for a combined production-transportation problem
• scientific article; zbMATH DE number 89415 (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 Lagrangian based branch-and-bound algorithm for production-transportation problems
• A general purpose exact solution method for mixed integer concave minimization problems
• A solution technique for capacitated two-level hierarchical time minimization transportation problem

This page was built for publication: A SIMPLICIAL BRANCH-AND-BOUND ALGORITHM FOR PRODUCTION-TRANSPORTATION PROBLEMS WITH INSEPARABLE CONCAVE PRODUCTION COST

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