18 search results - page 1 / 4 » On test sets for nonlinear integer maximization |
97
Voted
ORL
2008
15 years 1 months ago
2008
A finite test set for an integer optimization problem enables us to verify whether a feasible point attains the global optimum. We establish in this paper several general results ...
102
Voted
SIAMDM
2011
14 years 8 months ago
2011
Let S ⊆ Zn satisfy the property that conv(S) ∩ Zn = S. Then a convex set K is called an S-free convex set if int(K) ∩ S = ∅. A maximal S-free convex set is an S-free convex...
105
Voted
OL
2007
15 years 18 days ago
2007
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...
139
Voted
JMLR
2008
15 years 18 days ago
2008
We study a generative model in which hidden causes combine competitively to produce observations. Multiple active causes combine to determine the value of an observed variable thr...
110
Voted
DAGSTUHL
2008
15 years 2 months ago
2008
The research on real-time scheduling has mostly focused on the development of algorithms that allows to test whether the constraints imposed on the task execution (often expressed ...