251 search results - page 4 / 51 » On Modular Decomposition of Integers |
WEA
2010
Springer
14 years 2 months ago
2010
Springer
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
COR
2010
13 years 7 months ago
2010
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
SWAT
2004
Springer
14 years 22 days ago
2004
Springer
The first polynomial time algorithm (O(n4 )) for modular decomposition appeared in 1972 [8] and since then there have been incremental improvements, eventually resulting in linear...
DAM
2006
13 years 7 months ago
2006
This paper presents an optimal fully dynamic recognition algorithm for directed cographs. Given the modular decomposition tree of a directed cograph G, the algorithm supports arc ...
ISAMI
2010
13 years 5 months ago
2010
Many adaptative context-aware middleware exist and most of them rely on so-called vertical architectures that offer a functional decomposition for contextawareness. This architectu...