Mixed-integer benchmark problems for single- and bi-objective optimization.
Tea TusarDimo BrockhoffNikolaus HansenPublished in: GECCO (2019)
Keyphrases
- benchmark problems
- mixed integer
- simulated annealing
- test problems
- optimization problems
- benders decomposition
- convex hull
- feasible solution
- mixed integer programming
- lot sizing
- continuous relaxation
- job shop scheduling problem
- linear program
- valid inequalities
- facility location
- network design problem
- combinatorial optimization
- lagrangian heuristic
- neural network
- vehicle routing problem
- branch and bound
- evolutionary algorithm
- optimal solution