Dynamic bundling: Less effort for more solutions

DOI10.1007/3-540-45622-8_6MaRDI QIDQ4737580zbMATH OpenFDO

Authors Berthe Y. Choueiry, Amy M. Davis

Publication date 11 August 2004

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2371/23710064.htm

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

Recommendations

• How the level of interchangeability embedded in a finite constraint satisfaction problem affects the performance of search
• Dynamic global constraints in backtracking based environments
• Robustness and stability in constraint programming under dynamism and uncertainty
• scientific article; zbMATH DE number 1149402
• Branching constraint satisfaction problems for solutions robust under likely changes

Cited in

(1)

• A modified scenario bundling method for shortest path network interdiction under endogenous uncertainty

This page was built for publication: Dynamic bundling: Less effort for more solutions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4737580)