On the Hardness of Some Geometric Optimization Problems with Rectangles.
Supantha PanditPublished in: COCOA (2019)
Keyphrases
- optimization problems
- evolutionary algorithm
- metaheuristic
- cost function
- objective function
- geometric structure
- genetic algorithm
- traveling salesman problem
- np hardness
- optimization methods
- learning theory
- information theoretic
- np hard
- computational complexity
- artificial intelligence
- information retrieval
- machine learning
- linear programming
- case study
- image processing
- phase transition
- geometric features
- geometric information
- data sets