Pages that link to "Item:Q2281448"
From MaRDI portal
The following pages link to QPLIB: a library of quadratic programming instances (Q2281448):
Displayed 26 items.
- QPLIB (Q42997) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- Quadratic maximization of reachable values of affine systems with diagonalizable matrix (Q2032024) (← links)
- Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems (Q2044489) (← links)
- MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library (Q2062317) (← links)
- A sublevel moment-SOS hierarchy for polynomial optimization (Q2070330) (← links)
- Compact mixed-integer programming formulations in quadratic optimization (Q2089884) (← links)
- Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
- Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem (Q2114581) (← links)
- Provable randomized rounding for minimum-similarity diversification (Q2134050) (← links)
- Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems (Q2146997) (← links)
- A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints (Q2147941) (← links)
- Tightening methods based on nontrivial bounds on bilinear terms (Q2168621) (← links)
- Benchmarking optimization software -- a (Hi)story (Q2225640) (← links)
- Optimal portfolio deleveraging under market impact and margin restrictions (Q2240011) (← links)
- Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic (Q2288876) (← links)
- A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs (Q2301138) (← links)
- A computational study on QP problems with general linear constraints (Q2673522) (← links)
- A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX (Q5060504) (← links)
- Variable Bound Tightening and Valid Constraints for Multiperiod Blending (Q5106407) (← links)
- BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints (Q5883708) (← links)
- Super-reparametrizations of weighted CSPs: properties and optimization perspective (Q6049436) (← links)
- A computational study of perspective cuts (Q6062884) (← links)
- Faster exact solution of sparse maxcut and QUBO problems (Q6095734) (← links)
- (Global) optimization: historical notes and recent developments (Q6114910) (← links)
- Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms (Q6181371) (← links)