Pages that link to "Item:Q585083"
From MaRDI portal
The following pages link to The indefinite zero-one quadratic problem (Q585083):
Displaying 28 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)
- An exact penalty function approach for nonlinear integer programming problems (Q580179) (← links)
- On duality for Boolean programming (Q750292) (← links)
- CON due-date determination and sequencing (Q908841) (← links)
- A study of the quadratic semi-assignment polytope (Q1013294) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- A solvable case of quadratic 0-1 programming (Q1079494) (← links)
- Experiments in quadratic 0-1 programming (Q1123806) (← links)
- A solvable class of quadratic 0-1 programming (Q1193723) (← links)
- Linear programming for the \(0-1\) quadratic knapsack problem (Q1268263) (← links)
- Spectral partitioning with multiple eigenvectors (Q1276952) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- Ranking in quadratic integer programming problems (Q1278381) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Minimization of a quadratic pseudo-Boolean function (Q1341991) (← links)
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming (Q1893147) (← links)
- Submodular function minimization and polarity (Q2097629) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- On the number of local maxima in quadratic 0-1 programs (Q2367394) (← links)
- Building an iterative heuristic solver for a quantum annealer (Q2374373) (← links)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
- Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming (Q2786313) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm<sup>1</sup> (Q3807879) (← links)
- Models and methods of solution of quadratic integer programming problems (Q3807880) (← links)
- Bounds for Random Binary Quadratic Programs (Q4609468) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
