Pages that link to "Item:Q1025986"
From MaRDI portal
The following pages link to Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method (Q1025986):
Displaying 50 items.
- Computational results of a semidefinite branch-and-bound algorithm for \(k\)-cluster (Q342176) (← 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)
- Reconstructing convex matrices by integer programming approaches (Q387306) (← links)
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach (Q427399) (← links)
- Extending the QCR method to general mixed-integer programs (Q662304) (← links)
- The MIN-cut and vertex separator problem (Q683339) (← links)
- Computational comparison of exact solution methods for 0-1 quadratic programs: recommendations for practitioners (Q778626) (← links)
- Scheduling with earliness-tardiness penalties and parallel machines (Q941007) (← 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)
- An optimal approach for the critical node problem using semidefinite programming (Q1620469) (← links)
- Globally solving quadratic programs with convex objective and complementarity constraints via completely positive programming (Q1716972) (← links)
- A note on representations of linear inequalities in non-convex mixed-integer quadratic programs (Q1728372) (← links)
- An exact solution method for quadratic matching: the one-quadratic-term technique and generalisations (Q1751141) (← 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)
- Solving \(k\)-cluster problems to optimality with semidefinite programming (Q1925793) (← links)
- On the quadratic model for unrelated parallel machine scheduling problem with restrictive common due date (Q1926635) (← links)
- An efficient compact quadratic convex reformulation for general integer quadratic programs (Q1938903) (← links)
- Minimizing weighted earliness-tardiness on a single machine with a common due date using quadratic models (Q1939105) (← links)
- Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation (Q2045008) (← links)
- The linearization problem of a binary quadratic problem and its applications (Q2070726) (← links)
- Dantzig-Wolfe reformulations for binary quadratic problems (Q2125570) (← links)
- Structured linear reformulation of binary quadratically constrained quadratic programs (Q2174904) (← links)
- A neurodynamic approach to zero-one quadratic programming (Q2234482) (← links)
- QPLIB: a library of quadratic programming instances (Q2281448) (← links)
- Solution of Boolean quadratic programming problems by two augmented Lagrangian algorithms based on a continuous relaxation (Q2307500) (← links)
- Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem (Q2311115) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← 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)
- Mathematical optimization ideas for biodiversity conservation (Q2356177) (← links)
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study (Q2397091) (← links)
- The symmetric quadratic traveling salesman problem (Q2434982) (← links)
- Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints (Q2448160) (← links)
- A compact variant of the QCR method for quadratically constrained quadratic \(0-1\) programs (Q2448194) (← links)
- Threshold-based preprocessing for approximating the weighted dense \(k\)-subgraph problem (Q2514764) (← links)
- Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds (Q2630836) (← links)
- Tighter quadratically constrained convex reformulations for semi-continuous quadratic programming (Q2666655) (← links)
- On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations (Q2826815) (← links)
- On linear conic relaxation of discrete quadratic programs (Q2829559) (← links)
- AN IMPROVED CONVEX 0-1 QUADRATIC PROGRAM REFORMULATION FOR CHANCE-CONSTRAINED QUADRATIC KNAPSACK PROBLEMS (Q2846489) (← links)
- Numerical Study of Semidefinite Bounds for the k-cluster Problem (Q2883586) (← links)
- SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY (Q2931718) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- Maximum probability O-D matrix estimation in large-sized networks (Q3389550) (← links)
