Probabilistic Combinatorial Optimization: Moments, Semidefinite Programming, and Asymptotic Bounds.
Dimitris BertsimasKarthik NatarajanChung-Piaw TeoPublished in: SIAM J. Optim. (2004)
Keyphrases
- combinatorial optimization
- semidefinite programming
- linear programming
- metaheuristic
- simulated annealing
- traveling salesman problem
- interior point methods
- worst case
- rates of convergence
- primal dual
- kernel matrix
- semidefinite
- probabilistic model
- lower bound
- bayesian networks
- interior point
- upper bound
- optimization problems
- maximum margin
- np hard
- kernel function
- linear program
- training data