Publication date
January 2011
DOIAbstract
We present an algorithm for minimizing a convex function over all integer vectors in the plane. This problem generalizes both the nearest lattice vector problem and the integer programming problem in the plane
We present an algorithm for minimizing a convex function over all integer vectors in the plane. This problem generalizes both the nearest lattice vector problem and the integer programming problem in the plane
Abstract: A novel approach to solving the problems of discrete (integer) optimization base...
We consider box-constrained integer programs with objective g(Wx) + cTx, where g is a “complicated” ...
We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a l...
We present an algorithm for minimizing a convex function over all integer vectors in the plane. This...
We present a branch-and-bound algorithm for minimizing multiple convex quadratic objective function...
A branch-and-bound method is proposed for minimizing a convex-concave function over a convex set. Th...
Copyright © by the paper's authors.An algorithm is suggested for solving a convex programming proble...
© 2016, Allerton Press, Inc.For a convex programming problem we propose a solution method which belo...
In this paper, we compare the definitions of convex sets and convex functions in finite dimensional ...
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over in...
We propose a branch-and-bound algorithm for minimizing a not necessarily convex quadratic function ...
We describe an algorithm for minimizing convex, not necessarily smooth, functions of several variabl...
We consider box-constrained integer programs with objective g(Wx) + cTx, where g is a “complicated” ...
Abstract. Minimizing a convex function over a convex set in n-dimensional space is a basic, general ...
AbstractWe study the minimization of an M-convex function introduced by Murota. It is shown that any...
Abstract: A novel approach to solving the problems of discrete (integer) optimization base...
We consider box-constrained integer programs with objective g(Wx) + cTx, where g is a “complicated” ...
We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a l...
We present an algorithm for minimizing a convex function over all integer vectors in the plane. This...
We present a branch-and-bound algorithm for minimizing multiple convex quadratic objective function...
A branch-and-bound method is proposed for minimizing a convex-concave function over a convex set. Th...
Copyright © by the paper's authors.An algorithm is suggested for solving a convex programming proble...
© 2016, Allerton Press, Inc.For a convex programming problem we propose a solution method which belo...
In this paper, we compare the definitions of convex sets and convex functions in finite dimensional ...
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over in...
We propose a branch-and-bound algorithm for minimizing a not necessarily convex quadratic function ...
We describe an algorithm for minimizing convex, not necessarily smooth, functions of several variabl...
We consider box-constrained integer programs with objective g(Wx) + cTx, where g is a “complicated” ...
Abstract. Minimizing a convex function over a convex set in n-dimensional space is a basic, general ...
AbstractWe study the minimization of an M-convex function introduced by Murota. It is shown that any...
Abstract: A novel approach to solving the problems of discrete (integer) optimization base...
We consider box-constrained integer programs with objective g(Wx) + cTx, where g is a “complicated” ...
We consider the integer points in a unimodular cone K ordered by a lexicographic rule defined by a l...
Add to ORKG