The following pages link to (Q5613011):
Displaying 39 items.
- A model for clustering data from heterogeneous dissimilarities (Q323236) (← links)
- Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
- The indefinite zero-one quadratic problem (Q585083) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← 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)
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems (Q992570) (← 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)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- The demand weighted vehicle routing problem (Q1754023) (← links)
- Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
- Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints (Q1761747) (← links)
- A computational study on the quadratic knapsack problem with multiple constraints (Q1761936) (← 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)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- On tail dependence matrices. The realization problem for parametric families (Q2191424) (← links)
- A binarisation heuristic for non-convex quadratic programming with box constraints (Q2294229) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- On simultaneous approximation in quadratic integer programming (Q2314408) (← links)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming (Q2666655) (← links)
- Ellipsoid Bounds for Convex Quadratic Integer Programming (Q2954394) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- Introduction to QUBO (Q5050141) (← links)
- The Random QUBO (Q5050147) (← links)
- Spectral Relaxations and Branching Strategies for Global Optimization of Mixed-Integer Quadratic Programs (Q5148407) (← links)
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
