scientific article; zbMATH DE number 1406246

MaRDI QIDQ4939284zbMATH OpenFDO

Authors Simon de Givry, P. Savéant, Jean Jourdan

Publication date 28 May 2000

zbMATH Keywords

depth first branch and bounditerative broadening

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Anytime AND/OR depth-first search for combinatorial optimization
• scientific article; zbMATH DE number 49948
• scientific article; zbMATH DE number 5503918
• Parameter estimation in branch and bound algorithms for large-scale discrete optimization problems
• Global optimization with a limited solution time

Cited in

(1)

• A unified framework for partial and hybrid search methods in constraint programming

This page was built for publication:

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