| |
| 2008 | ||
|---|---|---|
| 3 | EE | Daniel H. Leventhal, Meinolf Sellmann: The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. CPAIOR 2008: 142-157 |
| 2007 | ||
| 2 | EE | Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal: The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. CPAIOR 2007: 275-287 |
| 2006 | ||
| 1 | EE | Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann: A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. CPAIOR 2006: 16-28 |
| 1 | Ionut D. Aron | [1] |
| 2 | Luc Mercier | [2] |
| 3 | Meinolf Sellmann | [1] [2] [3] |