Pages that link to "Item:Q3494380"
From MaRDI portal
The following pages link to An algorithm for quadratic zero-one programs (Q3494380):
Displaying 8 items.
- The unconstrained binary quadratic programming problem: a survey (Q405668) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Ranking in quadratic integer programming problems (Q1278381) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
