Pages that link to "Item:Q359624"
From MaRDI portal
The following pages link to 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):
Displayed 6 items.
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← links)
- A generalized computing paradigm based on artificial dynamic models for mathematical programming (Q894649) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- Copositive Relaxation Beats Lagrangian Dual Bounds in Quadratically and Linearly Constrained Quadratic Optimization Problems (Q5501200) (← links)
