The transportation problem with exclusionary side constraints and two branch-and-bound algorithms

European Journal of Operational Research

Volumn 140, Issue 3, 2002, Pages 629-647

  Sun, Minghe ^a  

^a UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

Branch and bound; Integer programming; Logistics; Network flows; Transportation

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER SOFTWARE; CONSTRAINT THEORY; INTEGER PROGRAMMING; MATHEMATICAL MODELS; OPTIMIZATION; PROBLEM SOLVING; TRANSPORTATION;

TRANSPORTATION PROBLEMS;

OPERATIONS RESEARCH;

EID: 0036680997     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(01)00239-9     Document Type: Article

References (28)

1. A new optimization method for large scale fixed charge transportation problems
2. Design and implementation of large scale primal transshipment algorithms
3. Transportation problems with nonlinear side constraints: A branch-and-bound approach
4. Solving transportation problems with nonlinear side constraints with tabu search
5. A primal algorithm for solving a capacitated network flow problem with additional linear constraints
6. A tree search algorithm for mixed integer programming problems
7. An algorithm for the solution of mixed integer programming problems
8. Integer programming algorithms: A framework and state-of-the-art survey
9. Implementation and computational comparisons of primal, dual and primal-dual computer codes for minimum cost network flow problems
10. Solving singly constrained transshipment problems
11. Basis exchange characterizations for the simplex SON algorithm for LP/Embedded networks
12. Augmented threaded index method for network optimization
13. The fixed charge transportation problem: A computational study with a branch-and-bound code
14. A new branch-and-bound algorithm for the fixed charge transportation problem
15. Solving constrained transportation problems
16. Revised-modified penalties for the fixed charge transportation problem
17. A branch-and-bound method for the fixed charge transportation problem
18. Accelerated algorithms for labeling and relabeling of trees with application for distribution problems
19. A tabu search heuristic procedure for solving the transportation problem with exclusionary side constraints
20. An improved branch and bound method for integer programming