Derivative-free optimization of combinatorial problems - A case study in colorectal cancer screening.
David YoungWyatt HaneySelen CremaschiPublished in: Comput. Chem. Eng. (2021)
Keyphrases
- combinatorial problems
- derivative free
- combinatorial optimization
- unconstrained optimization
- colorectal cancer
- constraint programming
- neural learning
- gradient method
- metaheuristic
- optimization methods
- constrained optimization
- traveling salesman problem
- constraint satisfaction problems
- combinatorial search
- constraint satisfaction
- phase transition
- optimization problems
- optimization method
- trust region
- branch and bound algorithm
- fan beam
- global constraints
- nonlinear optimization
- objective function
- column generation
- global optimization
- branch and bound
- tabu search
- integer programming
- convergence rate
- genetic programming
- simulated annealing
- state space
- multi objective
- search space
- neural network