An Efficient Structured Perceptron for NP-Hard Combinatorial Optimization Problems.
Bastián VéjarGaël AglinAli Irfan MahmutogullariSiegfried NijssenPierre SchausTias GunsPublished in: CPAIOR (2) (2024)
Keyphrases
- hard combinatorial optimization problems
- benchmark problems
- combinatorial optimization
- metaheuristic
- combinatorial problems
- ant colony optimisation
- neural network
- simulated annealing
- optimal solution
- learning algorithm
- optimisation problems
- vehicle routing problem
- traveling salesman problem
- constraint satisfaction
- fuzzy rules
- ant colony optimization
- optimization problems
- artificial neural networks
- computational complexity