Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2717783
Jump to:navigation, search

zbMath0970.68192MaRDI QIDQ2717783

Xinguang Chen, Peter J. L. van Beek

Publication date: 18 June 2001


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

backtracking algorithms


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)


Related Items

Multistage robust discrete optimization via quantified integer programming, Large-scale periodic scheduling in time-sensitive networks, Enhancing DLV instantiator by backjumping techniques, Determining if (FC-) (conflict-directed) backjumping visits a given node is NP-hard, A Flexible Search Framework for CHR, Constraint Propagation with Tabu List for Min-Span Frequency Assignment Problem, Reasoning from last conflict(s) in constraint programming, Implementing Efficient All Solutions SAT Solvers, Backjump-based backtracking for constraint satisfaction problems, Variable and value elimination in binary constraint satisfaction via forbidden patterns, Backjumping for quantified Boolean logic satisfiability, Hybrid backtracking bounded by tree-decomposition of constraint networks, Efficient solution techniques for disjunctive temporal reasoning problems



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2717783&oldid=15577173"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 14:35.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki