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

DOI10.15807/jorsj.48.97zbMath1274.90060OpenAlexW2125168722MaRDI QIDQ5694060

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

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

Related Items (5)

An iterative algorithm for two level hierarchical time minimization transportation problem ⋮ A feasible flow-based iterative algorithm for the two-level hierarchical time minimization transportation problem ⋮ A general purpose exact solution method for mixed integer concave minimization problems ⋮ A solution technique for capacitated two-level hierarchical time minimization transportation problem ⋮ A simplicial branch-and-bound algorithm conscious of special structures in concave minimization problems

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