Use of penalties in a branch and bound procedure for the fixed charge transportation problem
- 1 December 1989
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 43 (3) , 305-312
- https://doi.org/10.1016/0377-2217(89)90229-4
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Some branch‐and‐bound procedures for fixed‐cost transportation problemsNaval Research Logistics Quarterly, 1984
- Linear Relaxations of the Capacitated Warehouse Location ProblemJournal of the Operational Research Society, 1982
- An integer programming algorithm for portfolio selection with fixed chargesNaval Research Logistics Quarterly, 1982
- A branch‐and‐bound algorithm for solving fixed charge problemsNaval Research Logistics Quarterly, 1981
- A New Optimization Method for Large Scale Fixed Charge Transportation ProblemsOperations Research, 1981
- A more compact formulation of the symmetric multiple traveling salesman problem with fixed chargesNetworks, 1981
- A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge ProblemManagement Science, 1976
- Integer Programming Algorithms: A Framework and State-of-the-Art SurveyManagement Science, 1972