90 search results - page 17 / 18 » Combinatorial Benders' Cuts |
110
Voted
ANTSW
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. In this paper, a Cooperative Network Game (CNG) is introduced. In this game, all players have the same goal: display a video content in real time, with no cuts and low bu...
105
click to vote
CP
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. Lazy clause generation is a powerful hybrid approach to combinatorial optimization that combines features from SAT solving and finite domain (FD) propagation. In lazy cla...
119
click to vote
CONSTRAINTS
2011
14 years 7 months ago
2011
Abstract The G12 project is developing a software environment for stating and solving combinatorial problems by mapping a high-level model of the problem to an efficient combinatio...
147
Voted
WEA
2010
Springer
15 years 7 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 ...
102
click to vote
BMCBI
2007
15 years 4 days ago
2007
Background: A combination of multiple types of transcription factors and cis-regulatory elements is often required for gene expression in eukaryotes, and the combinatorial regulat...