Complexity comparison of integer programming and genetic algorithms for resource constrained scheduling problems.
Rebeka CoricMateja DumicDomagoj JakobovicPublished in: MIPRO (2017)
Keyphrases
- integer programming
- resource constrained
- scheduling problem
- np hard
- resource limitations
- genetic algorithm
- wireless sensor networks
- resource constraints
- sensor networks
- linear programming
- cutting plane
- network flow
- lagrangian relaxation
- constraint programming
- column generation
- computational complexity
- cutting plane algorithm
- multipath
- tabu search
- embedded systems
- rfid tags
- multi objective
- special case
- knapsack problem
- end to end
- constraint satisfaction
- metaheuristic
- reinforcement learning
- particle swarm optimization
- integer program
- simulated annealing
- set partitioning
- real time