Pages that link to "Item:Q868442"
From MaRDI portal
The following pages link to Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem (Q868442):
Displayed 50 items.
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- On the bridge between combinatorial optimization and nonlinear optimization: a family of semidefinite bounds for 0--1 quadratic problems leading to quasi-Newton methods (Q359624) (← links)
- Geometric relationship between parallel hyperplanes, quadrics, and vertices of a hypercube (Q375961) (← links)
- 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)
- A column generation approach for the unconstrained binary quadratic programming problem (Q439327) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- Quadratic reformulations of nonlinear binary optimization problems (Q517297) (← links)
- An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs (Q604951) (← links)
- New formulations of the multiple sequence alignment problem (Q628651) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Convex relaxations for mixed integer predictive control (Q710707) (← links)
- DC decomposition based branch-and-bound algorithms for box-constrained quadratic programs (Q723488) (← links)
- On exact solution approaches for bilevel quadratic 0-1 knapsack problem (Q829202) (← links)
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations (Q847837) (← 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)
- Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems (Q1681134) (← links)
- A new branch-and-bound approach to semi-supervised support vector machine (Q1699749) (← links)
- An enhanced MILP-based branch-and-price approach to modularity density maximization on graphs (Q1734849) (← links)
- Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint (Q1753128) (← links)
- Quadratic convex reformulation for quadratic programming with linear on-off constraints (Q1755375) (← links)
- The minimum distance superset problem: formulations and algorithms (Q1756748) (← 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)
- Improving a Lagrangian decomposition for the unconstrained binary quadratic programming problem (Q1762145) (← links)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
- A new effective branch-and-bound algorithm to the high order MIMO detection problem (Q2012893) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- Convex reformulation for binary quadratic programming problems via average objective value maximization (Q2018868) (← links)
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results (Q2039061) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- The potential of quantum annealing for rapid solution structure identification (Q2074663) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- An intuitionistic fuzzy set based \(S^3\)VM model for binary classification with mislabeled information (Q2272418) (← links)
- A semi-supervised random vector functional-link network based on the transductive framework (Q2282876) (← 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)
- Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems (Q2329727) (← links)
- On the separation of split inequalities for non-convex quadratic integer programming (Q2339844) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- Conic approximation to quadratic optimization with linear complementarity constraints (Q2397094) (← links)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- Improved semidefinite bounding procedure for solving max-cut problems to optimality (Q2436651) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Computational experience with a bundle approach for semidefinite cutting plane relaxations of Max-Cut and equipartition (Q2583135) (← links)
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming (Q2666655) (← links)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)