A constant time algorithm for some optimization problems in rotagraphs and fasciagraphs.
Marwane BouznifJulien MoncelMyriam PreissmannPublished in: Discret. Appl. Math. (2016)
Keyphrases
- optimization problems
- objective function
- cost function
- dynamic programming
- improved algorithm
- detection algorithm
- worst case
- preprocessing
- optimal solution
- learning algorithm
- benchmark problems
- matching algorithm
- optimization algorithm
- selection algorithm
- computationally efficient
- particle swarm optimization
- neural network
- probabilistic model
- experimental evaluation
- data sets
- decision trees
- np hard
- significant improvement
- high accuracy
- search space
- ant colony optimization
- single pass
- estimation algorithm
- knapsack problem
- traveling salesman problem
- k means
- segmentation algorithm
- theoretical analysis
- linear programming
- knn