80 search results - page 1 / 16 » Integer Programming Subject to Monomial Constraints |
76
Voted
SIAMJO
2010
14 years 4 months ago
2010
Abstract. We investigate integer programs containing monomial constraints of the type Q iI xi i = b. Due to the number-theoretic nature of these constraints, standard methods based...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We present a faster exponential-time algorithm for integer optimization over quasi-convex polynomials. We study the minimization of a quasiconvex polynomial subject to s quasi-con...
SIAMJO
2008
14 years 9 months ago
2008
We propose a new class of stochastic integer programs whose special features are dominance constraints induced by mixed-integer linear recourse. For these models, we establish clo...
CP
2006
Springer
15 years 1 months ago
2006
Springer
We study a family of problems, called Maximum Solution, where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variables subjec...
120
click to vote
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
Abstract. We propose a hybrid approach for solving the resource-constrained project scheduling problem which is an extremely hard to solve combinatorial optimization problem of pra...