The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
Author:
- 1 August 2002
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 140 (3) , 629-647
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Solving transportation problems with nonlinear side constraints with tabu searchComputers & Operations Research, 1995
- Transportation problem with nonlinear side constraints a branch and bound approachMathematical Methods of Operations Research, 1992
- A New Optimization Method for Large Scale Fixed Charge Transportation ProblemsOperations Research, 1981
- Solving Singly Constrained Transshipment ProblemsTransportation Science, 1978
- Exceptional Paper—Design and Implementation of Large Scale Primal Transshipment AlgorithmsManagement Science, 1977
- A primal algorithm for solving a capacitated network flow problem with additional linear constraintsNetworks, 1977
- Implementation and computational comparisons of primal, dual and primal‐dual computer codes for minimum cost network flow problemsNetworks, 1974
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972
- An Algorithm for the Solution of Mixed Integer Programming ProblemsManagement Science, 1966
- A tree-search algorithm for mixed integer programming problemsThe Computer Journal, 1965