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):
Displaying 30 items.
- 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)
- A mixed integer quadratic programming model for the low autocorrelation binary sequence problem (Q2871019) (← links)
- A Feasible Active Set Method for Strictly Convex Quadratic Problems with Simple Bounds (Q2945124) (← links)
- Lagrangean decompositions for the unconstrained binary quadratic programming problem (Q3087848) (← links)
- Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations (Q3539803) (← links)
- Reformulations in Mathematical Programming: Definitions and Systematics (Q3621976) (← links)
- Spectral bounds for the maximum cut problem (Q3632965) (← links)
- (Q4397866) (← links)
- Global solution of non-convex quadratically constrained quadratic programs (Q4646675) (← links)
- DC Programming and DCA for Challenging Problems in Bioinformatics and Computational Biology (Q4983006) (← links)
- A simultaneous diagonalization-based quadratic convex reformulation for nonconvex quadratically constrained quadratic program (Q5038154) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- The Random QUBO (Q5050147) (← links)
- QUBO Software (Q5050151) (← links)
- Computational study of a family of mixed-integer quadratic programming problems (Q5101407) (← links)
- LMI-based robust mixed-integer model predictive control for hybrid systems (Q5130053) (← links)
- A Unified Approach to Mixed-Integer Optimization Problems With Logical Constraints (Q5158761) (← links)
- A filled function method for quadratic programs with binary constraints† (Q5193139) (← links)
- Quadratic Convex Reformulations for Semicontinuous Quadratic Programming (Q5348460) (← links)
- Semidefinite Approaches for MIQCP: Convex Relaxations and Practical Methods (Q5351613) (← links)
- Solving the Production and Maintenance Optimization Problem by a Global Approach (Q5357763) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- Partial Lasserre relaxation for sparse Max-Cut (Q6050383) (← links)
- An exact quadratic programming approach based on convex reformulation for <i>seru</i> scheduling problems (Q6078600) (← links)
- An entropy-regularized ADMM for binary quadratic programming (Q6085714) (← links)
- Faster exact solution of sparse maxcut and QUBO problems (Q6095734) (← links)
- An exact cutting plane method for the Euclidean max-sum diversity problem (Q6096568) (← links)
- A new global algorithm for max-cut problem with chordal sparsity (Q6103705) (← links)
- Short paper -- The binary linearization complexity of pseudo-Boolean functions (Q6633276) (← links)