Sciweavers

120 search results - page 23 / 24
» On Bin Packing with Conflicts
Sort
View
CONSTRAINTS
2011
13 years 9 days 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...
VLDB
1998
ACM
82views Database» more  VLDB 1998»
13 years 9 months ago
Resource Scheduling for Composite Multimedia Objects
Scheduling algorithms for composite multimedia presentations need to ensure that the user-defined synchronization constraints for the various presentation components are met. This...
Minos N. Garofalakis, Yannis E. Ioannidis, Banu &O...
ECUMN
2007
Springer
13 years 11 months ago
Utility-Based Bandwidth Allocation for Triple-Play Services
It is expected that, in near future, the multi-class traffic previously in Public Switched Telephone network (PSTN), cable television network and IP network will be multiplexed at...
Changbin Liu, Lei Shi, Bin Liu
GECCO
2006
Springer
159views Optimization» more  GECCO 2006»
13 years 9 months ago
Multi-step environment learning classifier systems applied to hyper-heuristics
Heuristic Algorithms (HA) are very widely used to tackle practical problems in operations research. They are simple, easy to understand and inspire confidence. Many of these HAs a...
Javier G. Marín-Blázquez, Sonia Schu...
CEC
2010
IEEE
13 years 6 months ago
Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...