Lagrangian bounds in multiextremal polynomial and discrete optimization problems
Journal of Global Optimization
The bundle method for hard combinatorial optimization problems
Combinatorial optimization - Eureka, you shrink!
Exploiting semidefinite relaxations in constraint programming
Computers and Operations Research
Asymptotic Bayesian structure learning using graph supports for Gaussian graphical models
Journal of Multivariate Analysis
The equivalence of semidefinite relaxations of polynomial 0-1 and ±1 programs via scaling
Operations Research Letters
Deriving Finite Sphere Packings
SIAM Journal on Discrete Mathematics
Semidefinite relaxations for mixed 0-1 second-order cone program
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
| Hi-index | 0.00 |