Combinatorial Pure Exploration with Full-bandit Feedback and Beyond: Solving Combinatorial Optimization under Uncertainty with Limited Observation.
Yuko KurokiJunya HondaMasashi SugiyamaPublished in: CoRR (2020)
Keyphrases
- combinatorial optimization
- combinatorial search
- traveling salesman problem
- metaheuristic
- simulated annealing
- branch and bound
- optimization problems
- mathematical programming
- combinatorial problems
- combinatorial optimization problems
- quadratic assignment problem
- hard combinatorial optimization problems
- branch and bound algorithm
- max flow min cut
- robust optimization
- graph theory
- evolutionary algorithm
- memetic algorithm
- exact algorithms
- active exploration
- relevance feedback
- single machine scheduling problem
- path relinking
- vehicle routing problem