ScienceOpen:
research and publishing network
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
My ScienceOpen
Sign in
Register
Dashboard
Blog
About
Search
Advanced search
My ScienceOpen
Sign in
Register
Dashboard
Search
Search
Advanced search
For Publishers
Discovery
Metadata
Peer review
Hosting
Publishing
For Researchers
Join
Publish
Review
Collect
Blog
About
32
views
13
references
Top references
cited by
15
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
2,684
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Principles and Practice of Constraint Programming – CP 2011
Algorithm Selection and Scheduling
other
Author(s):
Serdar Kadioglu
,
Yuri Malitsky
,
Ashish Sabharwal
,
Horst Samulowitz
,
Meinolf Sellmann
Publication date
(Print):
2011
Publisher:
Springer Berlin Heidelberg
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Computer Vision, Deep Learning, Deep Reinforcement Learning, IoT
Most cited references
13
Record
: found
Abstract
: not found
Article
: not found
A Linear Programming Approach to the Cutting-Stock Problem
R. E. Gomory
,
P. Gilmore
(1961)
0
comments
Cited
152
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Book Chapter
: not found
The Algorithm Selection Problem
John R. Rice
(1976)
0
comments
Cited
123
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Cross-disciplinary perspectives on meta-learning for algorithm selection
Kate Smith-Miles
(2008)
0
comments
Cited
56
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2011
Pages
: 454-469
DOI:
10.1007/978-3-642-23786-7_35
SO-VID:
c400e21e-5f4a-4adb-b9ba-2dbb2ed2b92c
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 12
A Constraint Seeker: Finding and Ranking Global Constraints from Examples
pp. 27
Bin Repacking Scheduling in Virtualized Datacenters
pp. 385
Grid-Based SAT Solving with Iterative Partitioning and Clause Learning
pp. 225
Solving MAXSAT by Solving a Sequence of Simpler SAT Instances
pp. 414
On Deciding MUS Membership with QBF
pp. 454
Algorithm Selection and Scheduling
pp. 508
Constraint Reasoning and Kernel Clustering for Pattern Decomposition with Scaling
pp. 621
Boolean Equi-propagation for Optimized SAT Encoding
pp. 645
Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation
Similar content
2,684
Operational assessment of the 5-h on/10-h off watchstanding schedule on a US Navy ship: sleep patterns, mood and psychomotor vigilance performance of crewmembers in the nuclear reactor department.
Authors:
Nita Shattuck
,
Panagiotis Matsangas
Identification of the optimal combination dosing schedule of neoadjuvant ipilimumab plus nivolumab in macroscopic stage III melanoma (OpACIN-neo): a multicentre, phase 2, randomised, controlled trial
Authors:
Elisa Rozeman
,
Alexander M Menzies
,
Alexander C. J. van Akkooi
…
Identification of optimal dosing schedules of dacomitinib and osimertinib for a phase I/II trial in advanced
EGFR
-mutant non-small cell lung cancer
Authors:
Kamrine Poels
,
Adam J. Schoenfeld
,
Alex Makhnin
…
See all similar
Cited by
15
Machine Learning for First-Order Theorem Proving
Authors:
James P. Bridge
,
Sean B. Holden
,
Lawrence Paulson
Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors
Authors:
Lin Xu
,
Frank Hutter
,
Holger Hoos
…
Quantifying Homogeneity of Instance Sets for Algorithm Configuration
Authors:
Marius Thomas Schneider
,
Holger Hoos
See all cited by