We consider box-constrained integer programs with objective g(Wx) + cTx, where g is a “complicated” function with an m dimensional domain. Here we assume we have n≫ m variables and that W∈ Zm × n is an integer matrix with coefficients of absolute value at most Δ. We design an algorithm for this problem using only the mild assumption that the objective can be optimized efficiently when all but m variables are fixed, yielding a running time of nm(mΔ)O(m2). Moreover, we can avoid the term nm in several special cases, in particular when c= 0. Our approach can be applied in a variety of settings, generalizing several recent results. An important application are convex objectives of low domain dimension, where we imply a recent result by Hunkensc...
Many important problems from the operations research and statistics literatures exhibit either (a) l...
The thesis argues the case for exploiting certain structures in integer linear programs.\ud \ud Inte...
This dissertation is devoted to solving general mixed integer optimization problems. Our main focus ...
We consider box-constrained integer programs with objective g(Wx) + cTx, where g is a “complicated” ...
This paper gives an algorithm for solving linear programming problems. For a problem with n constrai...
We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N...
AbstractWe define a new measure of the structure of a linear constraint matrix and establish some pr...
In this paper we investigate the effects of replacing the objective function of a 0-1 mixed-integer ...
An integer program (IP) is a problem of the form $\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \i...
The problem of optimizing multivariate scalar polynomial functions over mixed-integer points in poly...
The problem of integer programming in bounded variables, over constraints with no more than twovari...
In this article we study convex integer maximization problems with com-posite objective functions of...
We present an algorithm for minimizing a convex function over all integer vectors in the plane. This...
In this dissertation consideration is given to the optimization of a function of n variables subject...
International audienceGiven a vector y ∈ R n and a matrix H ∈ R n×m , the sparse approximation probl...
Many important problems from the operations research and statistics literatures exhibit either (a) l...
The thesis argues the case for exploiting certain structures in integer linear programs.\ud \ud Inte...
This dissertation is devoted to solving general mixed integer optimization problems. Our main focus ...
We consider box-constrained integer programs with objective g(Wx) + cTx, where g is a “complicated” ...
This paper gives an algorithm for solving linear programming problems. For a problem with n constrai...
We consider N-fold 4-block decomposable integer programs, which simultaneously generalize N...
AbstractWe define a new measure of the structure of a linear constraint matrix and establish some pr...
In this paper we investigate the effects of replacing the objective function of a 0-1 mixed-integer ...
An integer program (IP) is a problem of the form $\min \{f(x) : \, Ax = b, \ l \leq x \leq u, \ x \i...
The problem of optimizing multivariate scalar polynomial functions over mixed-integer points in poly...
The problem of integer programming in bounded variables, over constraints with no more than twovari...
In this article we study convex integer maximization problems with com-posite objective functions of...
We present an algorithm for minimizing a convex function over all integer vectors in the plane. This...
In this dissertation consideration is given to the optimization of a function of n variables subject...
International audienceGiven a vector y ∈ R n and a matrix H ∈ R n×m , the sparse approximation probl...
Many important problems from the operations research and statistics literatures exhibit either (a) l...
The thesis argues the case for exploiting certain structures in integer linear programs.\ud \ud Inte...
This dissertation is devoted to solving general mixed integer optimization problems. Our main focus ...