scientific article; zbMATH DE number 2084733

MaRDI QIDQ4475663zbMATH OpenFDO

Authors Marco Cadoli

Publication date 9 August 2004

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

Mathematics Subject Classification ID

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

Recommendations

• The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
• The Power of Linear Programming for Finite-Valued CSPs: A Constructive Characterization
• Expressing combinatorial optimization problems by linear programs
• Solving LP relaxations of some NP-hard problems is as hard as solving any linear program
• Linear programs for constraint satisfaction problems

Cited in

(4)

• Formulation of multiple-choice situations in linear programming models using binary coding matrices
• The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
• scientific article; zbMATH DE number 3970525 (Why is no real title available?)
• The power of the binary value principle

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