1274 search results - page 65 / 255 » N-fold integer programming |
ISCAS
2006
IEEE
14 years 4 months ago
2006
IEEE
This paper proposes two new methods for optimizing objectives and constraints. The GP approach is very general and hardware resources in finite wordlength implementation of it allo...
TACAS
2010
Springer
14 years 5 months ago
2010
Springer
Ranking function synthesis is a key aspect to the success of modern termination provers for imperative programs. While it is wellknown how to generate linear ranking functions for ...
ATMOS
2008
13 years 11 months ago
2008
In the last 15 years periodic timetable problems have found much interest in the combinatorial optimization community. We will focus on the optimisation task to minimise a weighted...
MP
2008
13 years 10 months ago
2008
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
SIAMDM
2011
13 years 4 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...