A branch-and-bound algorithm to solve the linear ordering problem for weighted tournaments.
Irène CharonOlivier HudryPublished in: Discret. Appl. Math. (2006)
Keyphrases
- branch and bound algorithm
- mixed integer linear programming
- integer variables
- lower bound
- branch and bound
- finding an optimal solution
- lower bounding
- test problems
- upper bound
- combinatorial optimization
- np hard
- randomly generated problems
- precedence constraints
- optimal solution
- weighted max sat
- upper bounding
- variable ordering
- lagrangian relaxation
- exact methods
- single machine scheduling problem
- max sat
- strongly np hard
- mathematical programming
- search algorithm
- neural network
- maximum clique
- dynamic programming
- special case
- objective function