Dynamic programming bi-criteria combinatorial optimization.
Michal MankowskiMikhail MoshkovPublished in: Discret. Appl. Math. (2020)
Keyphrases
- combinatorial optimization
- bicriteria
- dynamic programming
- knapsack problem
- combinatorial optimization problems
- efficient solutions
- integer linear programming
- shortest path problem
- location problems
- simulated annealing
- optimization problems
- traveling salesman problem
- metaheuristic
- branch and bound algorithm
- mathematical programming
- combinatorial problems
- branch and bound
- state space
- single machine
- quadratic assignment problem
- vehicle routing problem
- flowshop
- max flow min cut
- hard combinatorial optimization problems
- greedy algorithm
- linear programming
- lagrangian relaxation
- single machine scheduling problem
- evolutionary algorithm
- optimal solution
- column generation
- multiple objectives
- tabu search
- completion times
- reinforcement learning
- genetic algorithm