Sciweavers

90 search results - page 17 / 18
» Combinatorial Benders' Cuts
Sort
View
ANTSW
2010
Springer
13 years 5 months ago
A Cooperative Network Game Efficiently Solved via an Ant Colony Optimization Approach
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...
Pablo Romero, Franco Robledo, Pablo Rodrígu...
CP
2009
Springer
13 years 5 months ago
Lazy Clause Generation Reengineered
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...
Thibaut Feydy, Peter J. Stuckey
CONSTRAINTS
2011
13 years 2 months ago
Dantzig-Wolfe decomposition and branch-and-price solving in G12
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...
Jakob Puchinger, Peter J. Stuckey, Mark G. Wallace...
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
14 years 2 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
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 ...
Gerald Gamrath, Marco E. Lübbecke
BMCBI
2007
111views more  BMCBI 2007»
13 years 7 months ago
MotifCombinator: a web-based tool to search for combinations of cis-regulatory motifs
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...
Mamoru Kato, Tatsuhiko Tsunoda