| 2008 |
|---|
| 28 | EE | Daniel H. Leventhal,
Meinolf Sellmann:
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems.
CPAIOR 2008: 142-157 |
| 27 | EE | Meinolf Sellmann:
The Polytope of Tree-Structured Binary Constraint Satisfaction Problems.
CPAIOR 2008: 367-371 |
| 2007 |
|---|
| 26 | | Irit Katriel,
Meinolf Sellmann,
Eli Upfal,
Pascal Van Hentenryck:
Propagating Knapsack Constraints in Sublinear Time.
AAAI 2007: 231-236 |
| 25 | EE | Meinolf Sellmann,
Luc Mercier,
Daniel H. Leventhal:
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.
CPAIOR 2007: 275-287 |
| 24 | EE | Meinolf Sellmann,
Thorsten Gellermann,
Robert Wright:
Cost-based Filtering for Shorter Path Constraints.
Constraints 12(2): 207-238 (2007) |
| 2006 |
|---|
| 23 | | Meinolf Sellmann,
Carlos Ansótegui:
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts.
AAAI 2006 |
| 22 | EE | Meinolf Sellmann:
The Theory of Grammar Constraints.
CP 2006: 530-544 |
| 21 | EE | Pierre Flener,
Justin Pearson,
Meinolf Sellmann,
Pascal Van Hentenryck:
Static and Dynamic Structural Symmetry Breaking.
CP 2006: 695-699 |
| 20 | EE | Daniel S. Heller,
Meinolf Sellmann:
Dynamic Symmetry Breaking Restarted.
CP 2006: 721-725 |
| 19 | EE | Claire Kenyon,
Meinolf Sellmann:
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming.
CPAIOR 2006: 126-138 |
| 18 | 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 |
| 2005 |
|---|
| 17 | EE | Meinolf Sellmann:
Approximated Consistency for the Automatic Recording Problem.
CP 2005: 822-826 |
| 16 | EE | Thorsten Gellermann,
Meinolf Sellmann,
Robert Wright:
Shorter Path Constraints for the Resource Constrained Shortest Path Problem.
CPAIOR 2005: 201-216 |
| 15 | EE | Meinolf Sellmann,
Pascal Van Hentenryck:
Structural Symmetry Breaking.
IJCAI 2005: 298-303 |
| 2004 |
|---|
| 14 | | Meinolf Sellmann:
The Practice of Approximated Consistency for Knapsack Constraints.
AAAI 2004: 179-184 |
| 13 | EE | Carla P. Gomes,
Meinolf Sellmann:
Streamlined Constraint Reasoning.
CP 2004: 274-289 |
| 12 | EE | Meinolf Sellmann:
Theoretical Foundations of CP-Based Lagrangian Relaxation.
CP 2004: 634-647 |
| 11 | EE | Carla P. Gomes,
Meinolf Sellmann,
Cindy van Es,
Harold van Es:
The Challenge of Generating Spatially Balanced Scientific Experiment Designs.
CPAIOR 2004: 387-394 |
| 2003 |
|---|
| 10 | EE | Meinolf Sellmann:
Approximated Consistency for Knapsack Constraints.
CP 2003: 679-693 |
| 9 | EE | Meinolf Sellmann:
Cost-Based Filtering for Shorter Path Constraints.
CP 2003: 694-708 |
| 8 | EE | Meinolf Sellmann,
Norbert Sensen,
Larissa Timajev:
Multicommodity Flow Approximation Used for Exact Graph Partitioning.
ESA 2003: 752-764 |
| 2002 |
|---|
| 7 | EE | Meinolf Sellmann,
Warwick Harvey:
Heuristic Constraint Propagation.
CP 2002: 738-743 |
| 6 | EE | Meinolf Sellmann:
An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint.
CP 2002: 744-749 |
| 5 | EE | Meinolf Sellmann,
Georg Kliewer,
Achim Koberstein:
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design.
ESA 2002: 845-858 |
| 4 | | Torsten Fahle,
Ulrich Junker,
Stefan E. Karisch,
Niklas Kohl,
Meinolf Sellmann,
Bo Vaaben:
Constraint Programming Based Column Generation for Crew Assignment.
J. Heuristics 8(1): 59-81 (2002) |
| 2001 |
|---|
| 3 | EE | Torsten Fahle,
Stefan Schamberger,
Meinolf Sellmann:
Symmetry Breaking.
CP 2001: 93-107 |
| 2 | EE | Meinolf Sellmann,
Torsten Fahle:
Coupling Variable Fixing Algorithms for the Automatic Recording Problem.
ESA 2001: 134-145 |
| 1999 |
|---|
| 1 | | Ulrich Junker,
Stefan E. Karisch,
Niklas Kohl,
Bo Vaaben,
Torsten Fahle,
Meinolf Sellmann:
A Framework for Constraint Programming Based Column Generation.
CP 1999: 261-274 |
