The Base-matroid and Inverse Combinatorial Optimization Problems.
Mauro Dell'AmicoFrancesco MaffioliFederico MalucelliPublished in: Discret. Appl. Math. (2003)
Keyphrases
- combinatorial optimization problems
- combinatorial optimization
- knapsack problem
- discrete optimization
- metaheuristic
- optimization problems
- traveling salesman problem
- ant colony optimization
- shortest path problem
- simulated annealing
- job shop scheduling
- greedy algorithm
- branch and bound algorithm
- continuous optimization problems
- exact algorithms
- branch and bound
- vehicle routing problem
- minmax regret
- job shop scheduling problem
- tabu search
- evolutionary algorithm
- min cost
- estimation of distribution algorithms
- objective function
- genetic algorithm