Boro Sofranac
YOU?
Author Swipe
View article: QUBO Dual Bounds via SDP Plane Projection Method
QUBO Dual Bounds via SDP Plane Projection Method Open
In this paper, we present a new method to solve a certain type of Semidefinite Programming (SDP) problems. These types of SDPs naturally arise in the Quadratic Convex Reformulation (QCR) method and can be used to obtain dual bounds of Quad…
View article: Learning Cuts via Enumeration Oracles
Learning Cuts via Enumeration Oracles Open
Cutting-planes are one of the most important building blocks for solving large-scale integer programming (IP) problems to (near) optimality. The majority of cutting plane approaches rely on explicit rules to derive valid inequalities that …
View article: Enabling Research through the SCIP Optimization Suite 8.0
Enabling Research through the SCIP Optimization Suite 8.0 Open
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP . The focus of this article is on the role of the SCIP Optimization Suit…
View article: The SCIP Optimization Suite 8.0
The SCIP Optimization Suite 8.0 Open
The SCIP Optimization Suite provides a collection of software packages for mathematical optimization centered around the constraint integer programming framework SCIP. This paper discusses enhancements and extensions contained in version 8…
View article: An Algorithm-Independent Measure of Progress for Linear Constraint Propagation
An Algorithm-Independent Measure of Progress for Linear Constraint Propagation Open
Propagation of linear constraints has become a crucial sub-routine in modern Mixed-Integer Programming (MIP) solvers. In practice, iterative algorithms with tolerance-based stopping criteria are used to avoid problems with slow or infinite…
View article: An Algorithm-Independent Measure of Progress for Linear Constraint Propagation
An Algorithm-Independent Measure of Progress for Linear Constraint Propagation Open
Propagation of linear constraints has become a crucial sub-routine in modern Mixed-Integer Programming (MIP) solvers. In practice, iterative algorithms with tolerance-based stopping criteria are used to avoid problems with slow or infinite…
View article: Accelerating Domain Propagation: an Efficient GPU-Parallel Algorithm\n over Sparse Matrices
Accelerating Domain Propagation: an Efficient GPU-Parallel Algorithm\n over Sparse Matrices Open
Fast domain propagation of linear constraints has become a crucial component\nof today's best algorithms and solvers for mixed integer programming and\npseudo-boolean optimization to achieve peak solving performance. Irregularities\nin the…