The following pages link to (Q5613011):
Displayed 13 items.
- The indefinite zero-one quadratic problem (Q585083) (← links)
- Concave extensions for nonlinear 0-1 maximization problems (Q689146) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442) (← links)
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986) (← links)
- Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations (Q1038328) (← links)
- Quadratic functions with exponential number of local maxima (Q1079496) (← links)
- Non-linear integer programming: Sensitivity analysis for branch and bound (Q1099075) (← links)
- A language and a program for stating and solving combinatorial problems (Q1245009) (← links)
- Ranking in quadratic integer programming problems (Q1278381) (← links)
- Bounds and fast approximation algorithms for binary quadratic optimzation problems with application to MAX 2SAT (Q1841891) (← links)
- A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)