The following pages link to Nebojša Gvozdenović (Q351546):
Displaying 8 items.
- New heuristics for the vertex coloring problem based on semidefinite programming (Q351547) (← links)
- Semidefinite bounds for the stability number of a graph via sums of squares of polynomials (Q877197) (← links)
- Block-diagonal semidefinite programming hierarchies for 0/1 programming (Q1002080) (← links)
- Two-echelon location routing synchronized with production schedules and time windows (Q1788921) (← links)
- (Q3105855) (← links)
- Semidefinite Bounds for the Stability Number of a Graph via Sums of Squares of Polynomials (Q3596364) (← links)
- The Operator $\Psi$ for the Chromatic Number of a Graph (Q3629507) (← links)
- Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization (Q3629508) (← links)
