Approximate algorithms for constrained circular cutting problems.
Mhand HifiRym M'HallahPublished in: Comput. Oper. Res. (2004)
Keyphrases
- optimization problems
- approximate solutions
- benchmark problems
- run times
- exact and approximate
- related problems
- computational cost
- computational problems
- test problems
- constrained problems
- difficult problems
- learning algorithm
- np hard problems
- computationally hard
- inference problems
- combinatorial optimization
- benchmark datasets
- computationally efficient
- worst case
- computational complexity
- convex optimization
- search methods
- theoretical analysis
- computational geometry
- theoretical guarantees
- hard problems
- multi objective
- significant improvement
- data structure
- convex optimization problems
- neural network