Probabilistic combinatorial optimization: Moments, semidefinite programming, and asymptotic bounds
10.1137/S1052623403430610
Saved in:
Main Authors: | Bertsimas, D., Natarajan, K., Teo, C.-P. |
---|---|
Other Authors: | DECISION SCIENCES |
Format: | Article |
Published: |
2013
|
Subjects: | |
Online Access: | http://scholarbank.nus.edu.sg/handle/10635/44011 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
Hybrid positive and negative correlation learning in estimation of distribution algorithm for combinatorial optimization problems
by: Warin Wattanapornprom
Published: (2012) -
Models for minimax stochastic linear optimization problems with risk aversion
by: Bertsimas, D., et al.
Published: (2013) -
Research Trends in Combinatorial Optimization
Published: (2017) -
Metaheuristics for NP-hard combinatorial optimization problems
by: DINH TRUNG HOANG
Published: (2010) -
A columnar competitive model with simulated annealing for solving combinatorial optimization problems
by: Eu, J.T., et al.
Published: (2014)