Daniel H. Leventhal

According to our database, Daniel H. Leventhal authored at least 3 papers between 2006 and 2008.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2008

The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems.

Daniel H. Leventhal, Meinolf Sellmann

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

2007

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.

Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

2006

A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming.

Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann

Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006