592 search results - page 39 / 119 » Using Constraint Programming to Solve the Maximum Clique Pro... |
110
click to vote
INFORMS
2010
15 years 9 days ago
2010
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
103
click to vote
SIAMJO
2008
15 years 2 months ago
2008
This paper presents a parameter-free integer-programming based algorithm for the global resolution of a linear program with linear complementarity constraints (LPCC). The cornersto...
117
click to vote
VLSID
2003
IEEE
16 years 3 months ago
2003
IEEE
In the previous work, the problem of nding gate delays to eliminate glitches has been solved by linear programs (LP) requiring an exponentially large number ofconstraints. By intr...
131
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
Abstract--In this paper, we investigate the use of messagepassing algorithms for the problem of finding the max-weight independent set (MWIS) in a graph. First, we study the perfor...
102
click to vote
CP
2004
Springer
15 years 8 months ago
2004
Springer
Cardinality matrix problems are the underlying structure of several real world problems such as rostering, sports scheduling , and timetabling. These are hard computational problem...