scientific article; zbMATH DE number 2084716

MaRDI QIDQ4475643zbMATH OpenFDO

Authors Javier Larrosa, Rina Dechter, K. Kask

Publication date 9 August 2004

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

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 2084714
• Principles and Practice of Constraint Programming – CP 2004
• A general non-linear optimization algorithm for lower bound limit analysis
• scientific article; zbMATH DE number 4064765
• A general method for solving constrained optimization problems
• Efficient approximation algorithms for multi-objective constraint optimization
• scientific article; zbMATH DE number 63645
• A hybrid method for solving general constrained optimization problems
• scientific article; zbMATH DE number 6501301

Cited in

(10)

• Principles and Practice of Constraint Programming – CP 2004
• Bounded approximate decentralised coordination via the max-sum algorithm
• scientific article; zbMATH DE number 2043437 (Why is no real title available?)
• Unifying tree decompositions for reasoning in graphical models
• Solving weighted CSP by maintaining arc consistency
• A certified natural-norm successive constraint method for parametric inf-sup lower bounds
• Semiring induced valuation algebras: exact and approximate local computation algorithms
• A Further Generalized Kettele Algorithm with Multiple Constraints
• AND/OR branch-and-bound search for combinatorial optimization in graphical models
• Partition-based lower bound for Max-CSP

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 Q4475643)