Pages that link to "Item:Q4859451"
From MaRDI portal
The following pages link to Testing optimality for quadratic 0?1 unconstrained problems (Q4859451):
Displaying 9 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- Efficient evaluations for solving large 0-1 unconstrained quadratic optimisation problems (Q537985) (← links)
- Active constraints, indefinite quadratic test problems, and complexity (Q911993) (← links)
- Testing optimality for quadratic 0-1 problems (Q1300278) (← links)
- Some thoughts on combinatorial optimisation (Q1388818) (← links)
- The quadratic M-convexity testing problem (Q1701120) (← links)
- Testing a Class of Methods for Solving Minimization Problems with Simple Bounds on the Variables (Q3788978) (← links)
- Simple Tests for Classifying Critical Points of Quadratics with Linear Constraints (Q3985131) (← links)
- Construction of test problems in quadratic bivalent programming (Q4371734) (← links)