Pages that link to "Item:Q4504791"
From MaRDI portal
The following pages link to Mixed linear and semidefinite programming for combinatorial and quadratic optimization (Q4504791):
Displaying 7 items.
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- A discrete dynamic convexized method for the max-cut problem (Q1761827) (← links)
- An inexact dual logarithmic barrier method for solving sparse semidefinite programs (Q2330644) (← links)
- LFTB: an efficient algorithm to bound linear fractional transformations (Q2575247) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
- Metaheuristic Algorithms (Q5050149) (← links)
- Positive semidefinite relaxations for distance geometry problems. (Q5960873) (← links)
