Heuristic, Branch-and-Bound Solver and Improved Space Reduction for the Median of Permutations Problem.
Robin MiloszSylvie HamelPublished in: IWOCA (2017)
Keyphrases
- branch and bound
- tree search
- space reduction
- optimal solution
- search algorithm
- branch and bound procedure
- combinatorial optimization
- beam search
- tree search algorithm
- lower bound
- branch and bound method
- branch and bound algorithm
- branch and bound search
- depth first search
- column generation
- lagrangian heuristic
- search strategies
- search space
- heuristic solution
- game tree search
- linear programming relaxation
- upper bound
- randomly generated problems
- network design problem
- iterative deepening
- dynamic programming
- objective function
- metaheuristic
- principal component analysis
- max sat
- partial solutions
- multi objective
- feature space
- mixed integer programming
- simulated annealing
- cost function
- constraint propagation
- evolutionary algorithm
- linear programming
- constraint satisfaction problems