A Framework for Constraint Programming Based Column Generation. - Ulrich Junker; Stefan E. Karisch; Niklas Kohl; Bo Vaaben; Torsten Fahle; Meinolf Sellmann (CP, 1999)

Symmetry Breaking. - Torsten Fahle; Stefan Schamberger; Meinolf Sellmann (CP, 2001)

Coupling Variable Fixing Algorithms for the Automatic Recording Problem. - Meinolf Sellmann; Torsten Fahle (ESA, 2001)

An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. - Meinolf Sellmann (CP, 2002)

Heuristic Constraint Propagation. - Meinolf Sellmann; Warwick Harvey (CP, 2002)

Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. - Meinolf Sellmann; Georg Kliewer; Achim Koberstein (ESA, 2002)

Cost Based Filtering for the Constrained Knapsack Problem. - Torsten Fahle; Meinolf Sellmann (Ann. Oper. Res., 2002)

Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search. - Meinolf Sellmann; Kyriakos Zervoudakis; Panagiotis Stamatopoulos; Torsten Fahle (Ann. Oper. Res., 2002)

Constraint Programming Based Column Generation for Crew Assignment. - Torsten Fahle; Ulrich Junker; Stefan E. Karisch; Niklas Kohl; Meinolf Sellmann; Bo Vaaben (J. Heuristics, 2002)

Reduction techniques in constraint programming and combinatorial optimization - Meinolf Sellmann (2002)

Approximated Consistency for Knapsack Constraints. - Meinolf Sellmann (CP, 2003)

Cost-Based Filtering for Shorter Path Constraints. - Meinolf Sellmann (CP, 2003)

Multicommodity Flow Approximation Used for Exact Graph Partitioning. - Meinolf Sellmann; Norbert Sensen; Larissa Timajev (ESA, 2003)

Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. - Meinolf Sellmann; Torsten Fahle (Ann. Oper. Res., 2003)

The Practice of Approximated Consistency for Knapsack Constraints. - Meinolf Sellmann (AAAI, 2004)

Streamlined Constraint Reasoning. - Carla P. Gomes; Meinolf Sellmann (CP, 2004)

Theoretical Foundations of CP-Based Lagrangian Relaxation. - Meinolf Sellmann (CP, 2004)

The Challenge of Generating Spatially Balanced Scientific Experiment Designs. - Carla P. Gomes; Meinolf Sellmann; Cindy van Es; Harold van Es (CPAIOR, 2004)

Approximated Consistency for the Automatic Recording Problem. - Meinolf Sellmann (CP, 2005)

Shorter Path Constraints for the Resource Constrained Shortest Path Problem. - Thorsten Gellermann; Meinolf Sellmann; Robert Wright (CPAIOR, 2005)

Structural Symmetry Breaking. - Meinolf Sellmann; Pascal Van Hentenryck (IJCAI, 2005)

Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. - Meinolf Sellmann; Carlos Ansótegui (AAAI, 2006)

Static and Dynamic Structural Symmetry Breaking. - Pierre Flener; Justin Pearson; Meinolf Sellmann; Pascal Van Hentenryck (CP, 2006)

Dynamic Symmetry Breaking Restarted. - Daniel S. Heller; Meinolf Sellmann (CP, 2006)

The Theory of Grammar Constraints. - Meinolf Sellmann (CP, 2006)

A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. - Ionut D. Aron; Daniel H. Leventhal; Meinolf Sellmann (CPAIOR, 2006)

Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. - Claire Kenyon; Meinolf Sellmann (CPAIOR, 2006)

Propagating Knapsack Constraints in Sublinear Time. - Irit Katriel; Meinolf Sellmann; Eli Upfal; Pascal Van Hentenryck (AAAI, 2007)

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. - Meinolf Sellmann; Luc Mercier; Daniel H. Leventhal (CPAIOR, 2007)

Cost-based Filtering for Shorter Path Constraints. - Meinolf Sellmann; Thorsten Gellermann; Robert Wright (Constraints An Int. J., 2007)

Efficient Context-Free Grammar Constraints. - Serdar Kadioglu; Meinolf Sellmann (AAAI, 2008)

Model Restarts for Structural Symmetry Breaking. - Daniel S. Heller; Aurojit Panda; Meinolf Sellmann; Justin Yip (CP, 2008)

Length-Lex Bounds Consistency for Knapsack Constraints. - Yuri Malitsky; Meinolf Sellmann; Willem Jan van Hoeve (CP, 2008)

Dichotomic Search Protocols for Constrained Optimization. - Meinolf Sellmann; Serdar Kadioglu (CP, 2008)

The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. - Daniel H. Leventhal; Meinolf Sellmann (CPAIOR, 2008)

The Polytope of Tree-Structured Binary Constraint Satisfaction Problems. - Meinolf Sellmann (CPAIOR, 2008)

A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. - Carlos Ansótegui; Meinolf Sellmann; Kevin Tierney (CP, 2009)

Same-Relation Constraints. - Christopher Jefferson; Serdar Kadioglu; Karen E. Petrie; Meinolf Sellmann; Stanislav Zivný (CP, 2009)

Dialectic Search. - Serdar Kadioglu; Meinolf Sellmann (CP, 2009)

On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency. - Meinolf Sellmann (CP, 2009)

Backdoors to Combinatorial Optimization: Feasibility and Optimality. - Bistra Dilkina; Carla P. Gomes; Yuri Malitsky; Ashish Sabharwal; Meinolf Sellmann (CPAIOR, 2009)

The Polytope of Context-Free Grammar Constraints. - Gilles Pesant; Claude-Guy Quimper; Louis-Martin Rousseau; Meinolf Sellmann (CPAIOR, 2009)

Enhanced Inference for the Market Split Problem. - Tarik Hadzic; Eoin O'Mahony; Barry O'Sullivan; Meinolf Sellmann (ICTAI, 2009)

Static and dynamic structural symmetry breaking. - Pierre Flener; Justin Pearson; Meinolf Sellmann (Ann. Math. Artif. Intell., 2009)

Dynamic structural symmetry breaking for constraint satisfaction problems. - Pierre Flener; Justin Pearson; Meinolf Sellmann; Pascal Van Hentenryck; Magnus Ågren 002 (Constraints An Int. J., 2009)

Special issue on constraint programming. - Gilles Pesant; Meinolf Sellmann; Bernard Gendron (Comput. Oper. Res., 2009)

Approximated consistency for the automatic recording constraint. - Meinolf Sellmann (Comput. Oper. Res., 2009)

Filtering Bounded Knapsack Constraints in Expected Sublinear Time. - Yuri Malitsky; Meinolf Sellmann; Radoslaw Szymanek (AAAI, 2010)

A Complete Multi-valued SAT Solver. - Siddhartha Jain 001; Eoin O'Mahony; Meinolf Sellmann (CP, 2010)

Upper Bounds on the Number of Solutions of Binary Integer Programs. - Siddhartha Jain 001; Serdar Kadioglu; Meinolf Sellmann (CPAIOR, 2010)

ISAC - Instance-Specific Algorithm Configuration. - Serdar Kadioglu; Yuri Malitsky; Meinolf Sellmann; Kevin Tierney (ECAI, 2010)

Grammar constraints. - Serdar Kadioglu; Meinolf Sellmann (Constraints An Int. J., 2010)

Stochastic Offline Programming. - Yuri Malitsky; Meinolf Sellmann (Int. J. Artif. Intell. Tools, 2010)

A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT. - Siddhartha Jain 001; Ashish Sabharwal; Meinolf Sellmann (AAAI, 2011)

Algorithm Selection and Scheduling. - Serdar Kadioglu; Yuri Malitsky; Ashish Sabharwal; Horst Samulowitz; Meinolf Sellmann (CP, 2011)

Incorporating Variance in Impact-Based Search. - Serdar Kadioglu; Eoin O'Mahony; Philippe Refalo; Meinolf Sellmann (CP, 2011)

Non-Model-Based Algorithm Portfolios for SAT. - Yuri Malitsky; Ashish Sabharwal; Horst Samulowitz; Meinolf Sellmann (SAT, 2011)

Non-Model-Based Search Guidance for Set Partitioning Problems. - Serdar Kadioglu; Yuri Malitsky; Meinolf Sellmann (AAAI, 2012)

Parallel SAT Solver Selection and Scheduling. - Yuri Malitsky; Ashish Sabharwal; Horst Samulowitz; Meinolf Sellmann (CP, 2012)

Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. - Yuri Malitsky; Meinolf Sellmann (CPAIOR, 2012)

Learning Back-Clauses in SAT - (Poster Presentation). - Ashish Sabharwal; Horst Samulowitz; Meinolf Sellmann (SAT, 2012)

Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering. - Yuri Malitsky; Ashish Sabharwal; Horst Samulowitz; Meinolf Sellmann (IJCAI, 2013)

Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction. - Yuri Malitsky; Ashish Sabharwal; Horst Samulowitz; Meinolf Sellmann (LION, 2013)

Snappy: A Simple Algorithm Portfolio. - Horst Samulowitz; Chandra Reddy; Ashish Sabharwal; Meinolf Sellmann (SAT, 2013)

MaxSAT by Improved Instance-Specific Algorithm Configuration. - Carlos Ansótegui; Yuri Malitsky; Meinolf Sellmann (AAAI, 2014)

Parallel Restarted Search. - André A. Ciré; Serdar Kadioglu; Meinolf Sellmann (AAAI, 2014)

Predisaster Preparation of Transportation Networks. - Hermann Schichl; Meinolf Sellmann (AAAI, 2015)

Model-Based Genetic Algorithms for Algorithm Configuration. - Carlos Ansótegui; Yuri Malitsky; Horst Samulowitz; Meinolf Sellmann; Kevin Tierney (IJCAI, 2015)

MaxSAT by improved instance-specific algorithm configuration. - Carlos Ansótegui; Joel Gabàs; Yuri Malitsky; Meinolf Sellmann (Artif. Intell., 2016)

Reactive Dialectic Search Portfolios for MaxSAT. - Carlos Ansótegui; Josep Pon; Meinolf Sellmann; Kevin Tierney (AAAI, 2017)

Learning a Reactive Restart Strategy to Improve Stochastic Search. - Serdar Kadioglu; Meinolf Sellmann; Markus Wagner 007 (LION, 2017)

Meta-Algorithms in Cognitive Computing. - Meinolf Sellmann (IEEE Intell. Syst., 2017)

Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. - Carlos Ansótegui; Meinolf Sellmann; Kevin Tierney (CP, 2018)

Hyper-Reactive Tabu Search for MaxSAT. - Carlos Ansótegui; Britta Heymann; Josep Pon; Meinolf Sellmann; Kevin Tierney (LION, 2018)

Consensual Affine Transformations for Partial Valuation Aggregation. - Hermann Schichl; Meinolf Sellmann (AAAI, 2019)

Exploiting Counterfactuals for Scalable Stochastic Optimization. - Stefan Kuhlemann; Meinolf Sellmann; Kevin Tierney (CP, 2019)

Empirical Confidence Models for Supervised Machine Learning. - Margarita P. Castro; Meinolf Sellmann; Zhaoyuan Yang; Nurali Virani (Canadian AI, 2020)

Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. - Meinolf Sellmann; Kevin Tierney (LION, 2020)

Learning to Optimize Black-Box Functions with Extreme Limits on the Number of Function Evaluations. - Carlos Ansótegui; Meinolf Sellmann; Tapan Shah 001; Kevin Tierney (LION, 2021)

PyDGGA: Distributed GGA for Automatic Configuration. - Carlos Ansótegui; Josep Pon; Meinolf Sellmann; Kevin Tierney (SAT, 2021)

Zeitenwende - Turn of Eras. - Meinolf Sellmann; Bart Selman (AI Mag., 2021)

Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations. - Carlos Ansótegui; Meinolf Sellmann; Tapan Shah 001; Kevin Tierney (CoRR, 2021)

Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection. - Meinolf Sellmann; Tapan Shah 001 (ICMLA, 2022)

Learning to Solve a Stochastic Orienteering Problem with Time Windows. - Fynn Schmitt-Ulms; André Hottung; Meinolf Sellmann; Kevin Tierney (LION, 2022)

Boosting evolutionary algorithm configuration. - Carlos Ansótegui; Josep Pon; Meinolf Sellmann (Ann. Math. Artif. Intell., 2022)

The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems. - Laurens Bliek; Paulo da Costa 001; Reza Refaei Afshar; Yingqian Zhang 001; Tom Catshoek; Daniël Vos; Sicco Verwer; Fynn Schmitt-Ulms; André Hottung; Tapan Shah 001; Meinolf Sellmann; Kevin Tierney; et al. (CoRR, 2022)

The first AI4TSP competition: Learning to solve stochastic routing problems. - Yingqian Zhang 001; Laurens Bliek; Paulo da Costa 001; Reza Refaei Afshar; Robbert Reijnen; Tom Catshoek; Daniël Vos; Sicco Verwer; Fynn Schmitt-Ulms; André Hottung; Tapan Shah 001; Meinolf Sellmann; et al. (Artif. Intell., 2023)