Pages that link to "Item:Q1583699"
From MaRDI portal
The following pages link to A semidefinite programming approach to the quadratic knapsack problem (Q1583699):
Displaying 14 items.
- A Second-Order Bundle Method Based on -Decomposition Strategy for a Special Class of Eigenvalue Optimizations (Q3188440) (← links)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
- A Decomposition Algorithm for the Sums of the Largest Eigenvalues (Q4985169) (← links)
- A two-phase method for solving continuous rank-one quadratic knapsack problems (Q5054022) (← links)
- A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization (Q5058729) (← links)
- Using Two-Dimensional Projections for Stronger Separation and Propagation of Bilinear Terms (Q5110560) (← links)
- Quadratic Combinatorial Optimization Using Separable Underestimators (Q5136070) (← links)
- Construction de facettes pour le polytope du sac-à-dos quadratique en 0-1 (Q5479831) (← links)
- Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem (Q5741470) (← links)
- Lagrangian heuristics for the quadratic knapsack problem (Q5963311) (← links)
- A lifted-space dynamic programming algorithm for the quadratic knapsack problem (Q6041830) (← links)
- Inductive linearization for binary quadratic programs with linear constraints (Q6057718) (← links)
- An inexact projected gradient method with rounding and lifting by nonlinear programming for solving rank-one semidefinite relaxation of polynomial optimization (Q6165592) (← links)
- Inductive linearization for binary quadratic programs with linear constraints: a computational study (Q6489313) (← links)
