Connections between continuous and combinatorial optimization problems through an extension of the fundamental theorem of Linear Programming.
Fabio TardellaPublished in: Electron. Notes Discret. Math. (2004)
Keyphrases
- combinatorial optimization problems
- linear programming
- knapsack problem
- metaheuristic
- combinatorial optimization
- optimization problems
- discrete optimization
- ant colony optimization
- optimal solution
- traveling salesman problem
- shortest path problem
- np hard
- job shop scheduling
- linear program
- dynamic programming
- objective function
- continuous optimization problems
- feasible solution
- job shop scheduling problem
- quadratic programming
- min cost
- minmax regret
- exact algorithms
- simulated annealing
- lagrangian relaxation
- neural network
- primal dual
- branch and bound
- data structure