A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function

DOI10.1002/ZAMM.19800600804zbMath0455.90057OpenAlexW2052335191MaRDI QIDQ5904676

C. R. Seshan, K. K. Achary

Publication date: 1980

Published in: ZAMM - Journal of Applied Mathematics and Mechanics / Zeitschrift für Angewandte Mathematik und Mechanik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/zamm.19800600804

zbMATH Keywords

transportation problembranch and bound algorithmpiecewise linear convex objective functionincreasing slopesminimization of total transportation cost

Mathematics Subject Classification ID

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

Cites Work

• Time‐minimizing transportation problems
• Unnamed Item

This page was built for publication: A Branch and Bound Algorithm for a Transportation Type Problem with Piecewise Linear Convex Objective Function