Sciweavers

150 search results - page 16 / 30
» Hybrid Constraint Tightening for Solving Hybrid Scheduling P...
Sort
View
HEURISTICS
2010
13 years 3 months ago
An evolutionary and constructive approach to a crew scheduling problem in underground passenger transport
Operation management of underground passenger transport systems is associated with combinatorial optimization problems (known as crew and train scheduling and rostering) which bel...
Rafael Elizondo, Víctor Parada, Lorena Prad...
ICPPW
2007
IEEE
14 years 2 months ago
P2P Live Streaming with Tree-Mesh based Hybrid Overlay
P2P technology has been widely adopted in live streaming system for its scalability and low commercial cost. However, tree based system or mesh based system still has to face the ...
Qi Huang, Hai Jin, Xiaofei Liao
CP
2009
Springer
14 years 3 months ago
Why Cumulative Decomposition Is Not as Bad as It Sounds
Abstract. The global cumulative constraint was proposed for modelling cumulative resources in scheduling problems for finite domain (FD) propagation. Since that time a great deal ...
Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, M...
JSAT
2006
134views more  JSAT 2006»
13 years 8 months ago
Pueblo: A Hybrid Pseudo-Boolean SAT Solver
This paper introduces a new hybrid method for efficiently integrating Pseudo-Boolean (PB) constraints into generic SAT solvers in order to solve PB satisfiability and optimization...
Hossein M. Sheini, Karem A. Sakallah
PROCEDIA
2011
12 years 11 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff