Pages that link to "Item:Q3494380"
From MaRDI portal
The following pages link to An algorithm for quadratic zero-one programs (Q3494380):
Displaying 17 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)
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture (Q757239) (← links)
- Bivalent quadratic programming problem - A computational study (Q801811) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- A solvable class of quadratic 0-1 programming (Q1193723) (← links)
- Complexity of uniqueness and local search in quadratic 0-1 programming (Q1197889) (← links)
- Ranking in quadratic integer programming problems (Q1278381) (← links)
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm (Q1278400) (← 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)
- Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
- Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case (Q3544267) (← links)
- An algorithm for quadratic optimization with one quadratic constraint and bounds on the variables (Q4209867) (← links)
- (Q4244993) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
