Note on Combinatorial Optimization with Max-Linear Objective Functions.
Sung-Jin ChungHorst W. HamacherFrancesco MaffioliKatta G. MurtyPublished in: Discret. Appl. Math. (1993)
Keyphrases
- combinatorial optimization
- optimization problems
- objective function
- metaheuristic
- combinatorial optimization problems
- traveling salesman problem
- branch and bound
- simulated annealing
- combinatorial problems
- mathematical programming
- branch and bound algorithm
- evolutionary algorithm
- hard combinatorial optimization problems
- graph theory
- ant colony optimization
- memetic algorithm
- exact algorithms
- path relinking
- quadratic assignment problem
- knapsack problem
- global optimum
- genetic programming
- convex functions
- single machine scheduling problem
- neural network