Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
28
views
17
references
Top references
cited by
6
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,626
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems
Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem
other
Author(s):
David Bergman
,
Andre A. Cire
,
Willem-Jan van Hoeve
,
John N. Hooker
Publication date
(Print):
2012
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
Microbiology Independent Research Journal (MIR Journal)
Most cited references
17
Record
: found
Abstract
: not found
Article
: not found
Graph-Based Algorithms for Boolean Function Manipulation
Bryant
(1986)
0
comments
Cited
137
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Binary Decision Diagrams
Akers
(1978)
0
comments
Cited
105
times
– based on
0
reviews
Review now
Bookmark
Record
: found
Abstract
: not found
Article
: not found
Sur les assemblages de lignes.
Camille Jordan
(1869)
0
comments
Cited
55
times
– based on
0
reviews
Review now
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2012
Pages
: 34-49
DOI:
10.1007/978-3-642-29828-8_3
SO-VID:
b18ee23a-3cbb-4655-b395-80eb3b5e6850
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 339
Hybrid Heuristics for Multimodal Homecare Scheduling
pp. 34
Variable Ordering for the Application of BDDs to the Maximum Independent Set Problem
pp. 228
Activity-Based Search for Black-Box Constraint Programming Solvers
Similar content
1,626
Zero-suppressed BDDS and their applications
Authors:
S. Minato
An improved data parallel algorithm for Boolean function manipulation using BDDs
Authors:
S. Gai
,
M. Rebaudengo
,
Sonza Reorda M.
Using Binary Decision Diagrams (BDDs) for Memory Optimization in Basic Local Alignment Search Tool (BLAST)
Authors:
See all similar
Cited by
6
Multivalued Decision Diagrams for Sequencing Problems
Authors:
Andre A. Cire
,
Willem-Jan Van Hoeve
Solving the Pricing Problem in a Branch-and-Price Algorithm for Graph Coloring Using Zero-Suppressed Binary Decision Diagrams
Authors:
David R. Morrison
,
Edward C Sewell
,
Sheldon Jacobson
Lagrangian bounds from decision diagrams
Authors:
David Bergman
,
Andre A. Cire
,
Willem-Jan Van Hoeve
See all cited by