We consider box-constrained integer programs with objective g(Wx) + c^T ...
Understanding the strategic behavior of miners in a blockchain is of gre...
We consider a classical scheduling problem on m identical machines. For ...
Breaking symmetries is a popular way of speeding up the branch-and-bound...
Obtaining strong linear relaxations of capacitated covering problems
con...
We consider a natural generalization of classical scheduling problems in...
The min-cost matching problem suffers from being very sensitive to small...
The Sum of Squares (SoS) hierarchy gives an automatized technique to cre...