A Hybrid Tabu Search/Branch-and-Bound Algorithm for the Direct Flight Network Design Problem.
Klaus BüdenbenderTore GrünertHans-Jürgen SebastianPublished in: Transp. Sci. (2000)
Keyphrases
- branch and bound algorithm
- network design problem
- tabu search
- branch and bound
- search algorithm
- lagrangian relaxation
- metaheuristic
- test problems
- max sat
- combinatorial optimization
- feasible solution
- simulated annealing
- optimal solution
- lower bound
- search space
- np hard
- scheduling problem
- approximation algorithms
- column generation
- integer variables
- search tree
- precedence constraints
- upper bound
- heuristic methods
- search procedure
- single machine scheduling problem
- genetic algorithm
- vehicle routing problem
- hybrid algorithm
- search strategies
- quadratic assignment problem
- combinatorial problems
- mixed integer
- network design
- mixed integer programming
- valid inequalities
- linear programming relaxation
- integer programming
- flowshop
- search strategy
- ant colony optimization
- evolutionary algorithm
- bayesian networks
- cost function
- constraint satisfaction problems
- traveling salesman problem
- satisfiability problem