 | 2009 |
|---|
| 42 |       | Carlos Ansótegui,
Meinolf Sellmann,
Kevin Tierney:
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms.
CP 2009: 142-157 |
| 41 | | Christopher Jefferson,
Serdar Kadioglu,
Karen E. Petrie,
Meinolf Sellmann,
Stanislav Zivný:
Same-Relation Constraints.
CP 2009: 470-485 |
| 40 | | Serdar Kadioglu,
Meinolf Sellmann:
Dialectic Search.
CP 2009: 486-500 |
| 39 | | Meinolf Sellmann:
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency.
CP 2009: 762-770 |
| 38 | | Gilles Pesant,
Claude-Guy Quimper,
Louis-Martin Rousseau,
Meinolf Sellmann:
The Polytope of Context-Free Grammar Constraints.
CPAIOR 2009: 223-232 |
| 37 | | Bistra N. Dilkina,
Carla P. Gomes,
Yuri Malitsky,
Ashish Sabharwal,
Meinolf Sellmann:
Backdoors to Combinatorial Optimization: Feasibility and Optimality.
CPAIOR 2009: 56-70 |
| 36 | | Pierre Flener,
Justin Pearson,
Meinolf Sellmann,
Pascal Van Hentenryck,
Magnus Ågren:
Dynamic structural symmetry breaking for constraint satisfaction problems.
Constraints 14(4): 506-538 (2009) |
| 2008 |
|---|
| 35 |  | Serdar Kadioglu,
Meinolf Sellmann:
Efficient Context-Free Grammar Constraints.
AAAI 2008: 310-316 |
| 34 | | Meinolf Sellmann,
Serdar Kadioglu:
Dichotomic Search Protocols for Constrained Optimization.
CP 2008: 251-265 |
| 33 | | Yuri Malitsky,
Meinolf Sellmann,
Willem Jan van Hoeve:
Length-Lex Bounds Consistency for Knapsack Constraints.
CP 2008: 266-281 |
| 32 | | Daniel S. Heller,
Aurojit Panda,
Meinolf Sellmann,
Justin Yip:
Model Restarts for Structural Symmetry Breaking.
CP 2008: 539-544 |
| 31 | | Daniel H. Leventhal,
Meinolf Sellmann:
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems.
CPAIOR 2008: 142-157 |
| 30 | | Meinolf Sellmann:
The Polytope of Tree-Structured Binary Constraint Satisfaction Problems.
CPAIOR 2008: 367-371 |
| 2007 |
|---|
| 29 | | Irit Katriel,
Meinolf Sellmann,
Eli Upfal,
Pascal Van Hentenryck:
Propagating Knapsack Constraints in Sublinear Time.
AAAI 2007: 231-236 |
| 28 | | Meinolf Sellmann,
Luc Mercier,
Daniel H. Leventhal:
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.
CPAIOR 2007: 275-287 |
| 27 | | Meinolf Sellmann,
Thorsten Gellermann,
Robert Wright:
Cost-based Filtering for Shorter Path Constraints.
Constraints 12(2): 207-238 (2007) |
| 2006 |
|---|
| 26 | | Meinolf Sellmann,
Carlos Ansótegui:
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts.
AAAI 2006 |
| 25 | | Meinolf Sellmann:
The Theory of Grammar Constraints.
CP 2006: 530-544 |
| 24 | | Pierre Flener,
Justin Pearson,
Meinolf Sellmann,
Pascal Van Hentenryck:
Static and Dynamic Structural Symmetry Breaking.
CP 2006: 695-699 |
| 23 | | Daniel S. Heller,
Meinolf Sellmann:
Dynamic Symmetry Breaking Restarted.
CP 2006: 721-725 |
| 22 | | Claire Kenyon,
Meinolf Sellmann:
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming.
CPAIOR 2006: 126-138 |
| 21 | | 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 |
|---|
| 20 | | Meinolf Sellmann:
Approximated Consistency for the Automatic Recording Problem.
CP 2005: 822-826 |
| 19 | | Thorsten Gellermann,
Meinolf Sellmann,
Robert Wright:
Shorter Path Constraints for the Resource Constrained Shortest Path Problem.
CPAIOR 2005: 201-216 |
| 18 | | Meinolf Sellmann,
Pascal Van Hentenryck:
Structural Symmetry Breaking.
IJCAI 2005: 298-303 |
| 2004 |
|---|
| 17 | | Meinolf Sellmann:
The Practice of Approximated Consistency for Knapsack Constraints.
AAAI 2004: 179-184 |
| 16 | | Carla P. Gomes,
Meinolf Sellmann:
Streamlined Constraint Reasoning.
CP 2004: 274-289 |
| 15 | | Meinolf Sellmann:
Theoretical Foundations of CP-Based Lagrangian Relaxation.
CP 2004: 634-647 |
| 14 | | 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 |
|---|
| 13 | | Meinolf Sellmann:
Approximated Consistency for Knapsack Constraints.
CP 2003: 679-693 |
| 12 | | Meinolf Sellmann:
Cost-Based Filtering for Shorter Path Constraints.
CP 2003: 694-708 |
| 11 | | Meinolf Sellmann,
Norbert Sensen,
Larissa Timajev:
Multicommodity Flow Approximation Used for Exact Graph Partitioning.
ESA 2003: 752-764 |
| 10 | | Meinolf Sellmann,
Torsten Fahle:
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem.
Annals OR 118(1-4): 17-33 (2003) |
| 2002 |
|---|
| 9 | | Meinolf Sellmann,
Warwick Harvey:
Heuristic Constraint Propagation.
CP 2002: 738-743 |
| 8 | | Meinolf Sellmann:
An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint.
CP 2002: 744-749 |
| 7 | | Meinolf Sellmann,
Georg Kliewer,
Achim Koberstein:
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design.
ESA 2002: 845-858 |
| 6 | | Meinolf Sellmann,
Kyriakos Zervoudakis,
Panagiotis Stamatopoulos,
Torsten Fahle:
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search.
Annals OR 115(1-4): 207-225 (2002) |
| 5 | | Torsten Fahle,
Meinolf Sellmann:
Cost Based Filtering for the Constrained Knapsack Problem.
Annals OR 115(1-4): 73-93 (2002) |
| 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 | | Torsten Fahle,
Stefan Schamberger,
Meinolf Sellmann:
Symmetry Breaking.
CP 2001: 93-107 |
| 2 | | 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 |
