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 15 items.
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Mixed settings for linear problems (Q582818) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Approximation algorithms from inexact solutions to semidefinite programming relaxations of combinatorial optimization problems (Q1751224) (← 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)
- Comparisons and enhancement strategies for linearizing mixed 0-1 quadratic programs (Q2386196) (← links)
- LFTB: an efficient algorithm to bound linear fractional transformations (Q2575247) (← links)
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
- Semidefinite and Lagrangian relaxations for hard combinatorial problems (Q2712834) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
- A framework for solving mixed-integer semidefinite programs (Q4637832) (← links)
- Metaheuristic Algorithms (Q5050149) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
- Positive semidefinite relaxations for distance geometry problems. (Q5960873) (← links)
