A revisited branch-and-cut algorithm for large-scale orienteering problems.
Gorka KobeagaMaría MerinoJosé Antonio LozanoPublished in: CoRR (2020)
Keyphrases
- expectation maximization
- benchmark problems
- detection algorithm
- learning algorithm
- optimization algorithm
- probabilistic model
- computational cost
- np hard
- search space
- theoretical analysis
- real world
- convex hull
- matching algorithm
- energy function
- linear systems
- approximate solutions
- segmentation algorithm
- data structure
- linear programming
- significant improvement
- worst case
- computational complexity
- preprocessing
- dynamic programming
- cost function
- computational geometry
- greedy algorithms
- iterative algorithms
- primal dual
- improved algorithm
- convergence rate
- combinatorial optimization
- clustering method
- image segmentation
- similarity measure
- input data
- optimization problems