QPLIB: a library of quadratic programming instances
From MaRDI portal
Publication:2281448
DOI10.1007/s12532-018-0147-4zbMath1435.90099OpenAlexW2790891482WikidataQ118165407 ScholiaQ118165407MaRDI QIDQ2281448
Ambros M. Gleixner, Stefan Vigerske, Emiliano Traversi, Fabio Furini, Pietro Belotti, Leo Liberti, Angelika Wiegele, Antonio Frangioni, Ruth Misener, Andrea Lodi, Nikolaos V. Sahinidis, Nick I. M. Gould, Hans D. Mittelmann
Publication date: 19 December 2019
Published in: Mathematical Programming Computation (Search for Journal in Brave)
Full work available at URL: https://basepub.dauphine.fr/handle/123456789/19154
quadratic programmingbinary quadratic programminginstance librarymixed integer quadratically constrained quadratic programming
Related Items
BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints, Provable randomized rounding for minimum-similarity diversification, Mining for diamonds -- matrix generation algorithms for binary quadratically constrained quadratic problems, A Classifier to Decide on the Linearization of Mixed-Integer Quadratic Problems in CPLEX, A wide neighborhood arc-search interior-point algorithm for convex quadratic programming with box constraints and linear constraints, Tightening methods based on nontrivial bounds on bilinear terms, A computational study on QP problems with general linear constraints, Super-reparametrizations of weighted CSPs: properties and optimization perspective, A computational study of perspective cuts, Variable Bound Tightening and Valid Constraints for Multiperiod Blending, Faster exact solution of sparse maxcut and QUBO problems, (Global) optimization: historical notes and recent developments, Tightening discretization-based MILP models for the pooling problem using upper bounds on bilinear terms, Benchmarking optimization software -- a (Hi)story, Optimal portfolio deleveraging under market impact and margin restrictions, Penalized semidefinite programming for quadratically-constrained quadratic optimization, Quadratic maximization of reachable values of affine systems with diagonalizable matrix, Time consistent expected mean-variance in multistage stochastic quadratic optimization: a model and a matheuristic, Computing mixed strategies equilibria in presence of switching costs by the solution of nonconvex QP problems, A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs, MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library, QPLIB, A sublevel moment-SOS hierarchy for polynomial optimization, Compact mixed-integer programming formulations in quadratic optimization, Continuous cubic formulations for cluster detection problems in networks, Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Ipopt
- Approximated perspective relaxations: a project and lift approach
- GLOMIQO: global mixed-integer quadratic optimizer
- Semidefinite relaxations for non-convex quadratic mixed-integer programming
- Global optimization of bilinear programs with a multiparametric disaggregation technique
- On the optimal design of water distribution networks: a practical MINLP approach
- The unconstrained binary quadratic programming problem: a survey
- A literature review on circle and sphere packing problems: models and methodologies
- Exploiting vector space properties to strengthen the relaxation of bilinear programs arising in the global optimization of process networks
- The small hexagon and heptagon with maximum sum of distances between vertices
- SCIP: solving constraint integer programs
- A computational comparison of reformulations of the perspective relaxation: SOCP vs. cutting planes
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- A survey for the quadratic assignment problem
- The small octagon with longest perimeter
- An algorithmic framework for convex mixed integer nonlinear programs
- Optimal quadratic programming algorithms. With applications to variational inequalities
- On solving trust-region and other regularised subproblems in optimization
- Simple polygons of maximum perimeter contained in a unit disk
- Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- Cutting circles and polygons from area-minimizing rectangles
- Numerical solution of a time-optimal parabolic boundary-value control problem
- A semidefinite framework for trust region subproblems with applications to large scale minimization
- Solving long-term financial planning problems via global optimization
- Recent advances in the solution of quadratic assignment problems
- On implementing a primal-dual interior-point method for conic quadratic optimization
- A primal-dual trust-region algorithm for non-convex nonlinear programming
- Stable reduced Hessian updates for indefinite quadratic programming
- The largest small octagon
- Delay-constrained routing problems: accurate scheduling models and admission control
- A polyhedral branch-and-cut approach to global optimization
- Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
- An iterative working-set method for large-scale nonconvex quadratic programming
- Solving pseudo-convex mixed integer optimization problems by cutting plane techniques
- Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
- Decomposition strategy for the stochastic pooling problem
- An efficient compact quadratic convex reformulation for general integer quadratic programs
- Towards globally optimal operation of water supply networks
- Portfolio optimization for wealth-dependent risk preferences
- A dual gradient-projection method for large-scale strictly convex quadratic problems
- Algorithms for an integer multicommodity network flow problem with node reliability considerations
- Cutting ellipses from area-minimizing rectangles
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- Delay-constrained shortest paths: approximation algorithms and second-order cone models
- Large-scale unit commitment under uncertainty
- Methods for convex and general quadratic programming
- Large-scale standard pooling problems with constrained pools and fixed demands
- A multi-commodity flow formulation for the generalized pooling problem
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons
- Trajectory-following methods for large-scale degenerate convex quadratic programming
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
- Perspective cuts for a class of convex 0-1 mixed integer programs
- Global solution approach for a nonconvex MINLP problem in product portfolio optimization
- Quadratic programming is in NP
- SDP diagonalizations and perspective cuts for a class of nonseparable MIQP
- Minimizing a Quadratic Over a Sphere
- Copositive Programming
- Global Approaches for Facility Layout and VLSI Floorplanning
- Relaxing Nonconvex Quadratic Functions by Multiple Adaptive Diagonal Perturbations
- Quadratic Programming with Computer Programs
- Projected Perspective Reformulations with Applications in Design Problems
- Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
- The MILP Road to MIQCP
- Perspective Reformulations of the CTA Problem with L2 Distances
- Solving the Trust-Region Subproblem By a Generalized Eigenvalue Problem
- Valid Inequalities for the Pooling Problem with Binary Variables
- BiqCrunch
- CONOPT: A GRG code for large sparse dynamic nonlinear optimization problems
- An Automatic Method of Solving Discrete Programming Problems
- Branching and bounds tighteningtechniques for non-convex MINLP
- The global solver in the LINDO API
- A Subspace Minimization Method for the Trust-Region Step
- Global Optimization of the Scenario Generation and Portfolio Selection Problems
- An outer-approximation algorithm for a class of mixed-integer nonlinear programs
- A projected Lagrangian algorithm and its implementation for sparse nonlinear constraints
- Optimal Damping Control and Nonlinear Elliptic Systems
- Large-scale linearly constrained optimization
- CONOPT—A Large-Scale GRG Code
- SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
- Solving the Trust-Region Subproblem using the Lanczos Method
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machines
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- The travelling salesman problem with neighbourhoods: MINLP solution
- A New Algorithm for MINLP Applied to Gas Transport Energy Cost Minimization
- Complete search in continuous global optimization and constraint satisfaction
- SNOPT: An SQP Algorithm for Large-Scale Constrained Optimization
- Global Optimization in Geometry — Circle Packing into the Square
- Object-oriented software for quadratic programming
- GALAHAD, a library of thread-safe Fortran 90 packages for large-scale nonlinear optimization
- A tree-search algorithm for mixed integer programming problems
- There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
