Meinolf Sellmann

Publication Activity (10 Years)

Years Active: 1999-2023
Publications (10 Years): 20

Top Topics

Hierarchical Clustering

Number Of Function Evaluations

Supervised Machine Learning

Top Venues

Publications

Yingqian Zhang, Laurens Bliek, Paulo da Costa, Reza Refaei Afshar, Robbert Reijnen, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, André Hottung, Tapan Shah, Meinolf Sellmann, Kevin Tierney, Carl Perreault-Lafleur, Caroline Leboeuf, Federico Bobbio, Justine Pepin, Warley Almeida Silva, Ricardo Gama, Hugo L. Fernandes, Martin Zaefferer, Manuel López-Ibáñez, Ekhine Irurozki
The first AI4TSP competition: Learning to solve stochastic routing problems. Artif. Intell. 319 (2023)
Meinolf Sellmann, Tapan Shah
Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection. ICMLA (2022)
Fynn Schmitt-Ulms, André Hottung, Meinolf Sellmann, Kevin Tierney
Learning to Solve a Stochastic Orienteering Problem with Time Windows. LION (2022)
Carlos Ansótegui, Josep Pon, Meinolf Sellmann
Boosting evolutionary algorithm configuration. Ann. Math. Artif. Intell. 90 (7) (2022)
Laurens Bliek, Paulo da Costa, Reza Refaei Afshar, Yingqian Zhang, Tom Catshoek, Daniël Vos, Sicco Verwer, Fynn Schmitt-Ulms, André Hottung, Tapan Shah, Meinolf Sellmann, Kevin Tierney, Carl Perreault-Lafleur, Caroline Leboeuf, Federico Bobbio, Justine Pepin, Warley Almeida Silva, Ricardo Gama, Hugo L. Fernandes, Martin Zaefferer, Manuel López-Ibáñez, Ekhine Irurozki
The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems. CoRR (2022)
Meinolf Sellmann, Bart Selman
Zeitenwende - Turn of Eras. AI Mag. 42 (1) (2021)
Carlos Ansótegui, Meinolf Sellmann, Tapan Shah, Kevin Tierney
Learning to Optimize Black-Box Functions with Extreme Limits on the Number of Function Evaluations. LION (2021)
Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney
PyDGGA: Distributed GGA for Automatic Configuration. SAT (2021)
Carlos Ansótegui, Meinolf Sellmann, Tapan Shah, Kevin Tierney
Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations. CoRR (2021)
Meinolf Sellmann, Tapan Shah
Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection. CoRR (2020)
Margarita P. Castro, Meinolf Sellmann, Zhaoyuan Yang, Nurali Virani
Empirical Confidence Models for Supervised Machine Learning. Canadian Conference on AI (2020)
Meinolf Sellmann, Kevin Tierney
Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. LION (2020)
Stefan Kuhlemann, Meinolf Sellmann, Kevin Tierney
Exploiting Counterfactuals for Scalable Stochastic Optimization. CP (2019)
Hermann Schichl, Meinolf Sellmann
Consensual Affine Transformations for Partial Valuation Aggregation. AAAI (2019)
Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney
Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. CP (2018)
Carlos Ansótegui, Britta Heymann, Josep Pon, Meinolf Sellmann, Kevin Tierney
Hyper-Reactive Tabu Search for MaxSAT. LION (2018)
Serdar Kadioglu, Meinolf Sellmann, Markus Wagner
Learning a Reactive Restart Strategy to Improve Stochastic Search. LION (2017)
Meinolf Sellmann
Meta-Algorithms in Cognitive Computing. IEEE Intell. Syst. 32 (4) (2017)
Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney
Reactive Dialectic Search Portfolios for MaxSAT. AAAI (2017)
Carlos Ansótegui, Joel Gabàs, Yuri Malitsky, Meinolf Sellmann
MaxSAT by improved instance-specific algorithm configuration. Artif. Intell. 235 (2016)
Carlos Ansótegui, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, Kevin Tierney
Model-Based Genetic Algorithms for Algorithm Configuration. IJCAI (2015)
Hermann Schichl, Meinolf Sellmann
Predisaster Preparation of Transportation Networks. AAAI (2015)
André A. Ciré, Serdar Kadioglu, Meinolf Sellmann
Parallel Restarted Search. AAAI (2014)
Carlos Ansótegui, Yuri Malitsky, Meinolf Sellmann
MaxSAT by Improved Instance-Specific Algorithm Configuration. AAAI (2014)
Horst Samulowitz, Chandra Reddy, Ashish Sabharwal, Meinolf Sellmann
Snappy: A Simple Algorithm Portfolio. SAT (2013)
Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann
Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction. LION (2013)
Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann
Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering. IJCAI (2013)
Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann
Parallel SAT Solver Selection and Scheduling. CP (2012)
Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann
Non-Model-Based Search Guidance for Set Partitioning Problems. AAAI (2012)
Yuri Malitsky, Meinolf Sellmann
Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR (2012)
Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann
Learning Back-Clauses in SAT - (Poster Presentation). SAT (2012)
Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann
Algorithm Selection and Scheduling. CP (2011)
Serdar Kadioglu, Eoin O'Mahony, Philippe Refalo, Meinolf Sellmann
Incorporating Variance in Impact-Based Search. CP (2011)
Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann
Non-Model-Based Algorithm Portfolios for SAT. SAT (2011)
Siddhartha Jain, Ashish Sabharwal, Meinolf Sellmann
A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT. AAAI (2011)
Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, Kevin Tierney
ISAC - Instance-Specific Algorithm Configuration. ECAI (2010)
Yuri Malitsky, Meinolf Sellmann
Stochastic Offline Programming. Int. J. Artif. Intell. Tools 19 (4) (2010)
Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann
Upper Bounds on the Number of Solutions of Binary Integer Programs. CPAIOR (2010)
Serdar Kadioglu, Meinolf Sellmann
Grammar constraints. Constraints An Int. J. 15 (1) (2010)
Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek
Filtering Bounded Knapsack Constraints in Expected Sublinear Time. AAAI (2010)
Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann
A Complete Multi-valued SAT Solver. CP (2010)
Yuri Malitsky, Meinolf Sellmann
Stochastic Offline Programming. ICTAI (2009)
Christopher Jefferson, Serdar Kadioglu, Karen E. Petrie, Meinolf Sellmann, Stanislav Zivný
Same-Relation Constraints. CP (2009)
Gilles Pesant, Meinolf Sellmann, Bernard Gendron
Special issue on constraint programming. Comput. Oper. Res. 36 (8) (2009)
Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, Magnus Ågren
Dynamic structural symmetry breaking for constraint satisfaction problems. Constraints An Int. J. 14 (4) (2009)
Gilles Pesant, Claude-Guy Quimper, Louis-Martin Rousseau, Meinolf Sellmann
The Polytope of Context-Free Grammar Constraints. CPAIOR (2009)
Pierre Flener, Justin Pearson, Meinolf Sellmann
Static and dynamic structural symmetry breaking. Ann. Math. Artif. Intell. 57 (1) (2009)
Meinolf Sellmann
Approximated consistency for the automatic recording constraint. Comput. Oper. Res. 36 (8) (2009)
Meinolf Sellmann
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency. CP (2009)
Tarik Hadzic, Eoin O'Mahony, Barry O'Sullivan, Meinolf Sellmann
Enhanced Inference for the Market Split Problem. ICTAI (2009)
Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. CP (2009)
Bistra Dilkina, Carla P. Gomes, Yuri Malitsky, Ashish Sabharwal, Meinolf Sellmann
Backdoors to Combinatorial Optimization: Feasibility and Optimality. CPAIOR (2009)
Serdar Kadioglu, Meinolf Sellmann
Dialectic Search. CP (2009)
Meinolf Sellmann
The Polytope of Tree-Structured Binary Constraint Satisfaction Problems. CPAIOR (2008)
Daniel H. Leventhal, Meinolf Sellmann
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. CPAIOR (2008)
Yuri Malitsky, Meinolf Sellmann, Willem Jan van Hoeve
Length-Lex Bounds Consistency for Knapsack Constraints. CP (2008)
Meinolf Sellmann, Serdar Kadioglu
Dichotomic Search Protocols for Constrained Optimization. CP (2008)
Serdar Kadioglu, Meinolf Sellmann
Efficient Context-Free Grammar Constraints. AAAI (2008)
Daniel S. Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip
Model Restarts for Structural Symmetry Breaking. CP (2008)
Meinolf Sellmann, Thorsten Gellermann, Robert Wright
Cost-based Filtering for Shorter Path Constraints. Constraints An Int. J. 12 (2) (2007)
Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. CPAIOR (2007)
Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck
Propagating Knapsack Constraints in Sublinear Time. AAAI (2007)
Daniel S. Heller, Meinolf Sellmann
Dynamic Symmetry Breaking Restarted. CP (2006)
Meinolf Sellmann
The Theory of Grammar Constraints. CP (2006)
Claire Kenyon, Meinolf Sellmann
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. CPAIOR (2006)
Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. CPAIOR (2006)
Meinolf Sellmann, Carlos Ansótegui
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. AAAI (2006)
Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck
Static and Dynamic Structural Symmetry Breaking. CP (2006)
Meinolf Sellmann, Pascal Van Hentenryck
Structural Symmetry Breaking. IJCAI (2005)
Meinolf Sellmann
Approximated Consistency for the Automatic Recording Problem. CP (2005)
Thorsten Gellermann, Meinolf Sellmann, Robert Wright
Shorter Path Constraints for the Resource Constrained Shortest Path Problem. CPAIOR (2005)
Meinolf Sellmann
Theoretical Foundations of CP-Based Lagrangian Relaxation. CP (2004)
Carla P. Gomes, Meinolf Sellmann
Streamlined Constraint Reasoning. CP (2004)
Carla P. Gomes, Meinolf Sellmann, Cindy van Es, Harold van Es
The Challenge of Generating Spatially Balanced Scientific Experiment Designs. CPAIOR (2004)
Meinolf Sellmann
The Practice of Approximated Consistency for Knapsack Constraints. AAAI (2004)
Meinolf Sellmann, Torsten Fahle
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Ann. Oper. Res. 118 (1-4) (2003)
Meinolf Sellmann
Cost-Based Filtering for Shorter Path Constraints. CP (2003)
Meinolf Sellmann, Norbert Sensen, Larissa Timajev
Multicommodity Flow Approximation Used for Exact Graph Partitioning. ESA (2003)
Meinolf Sellmann
Approximated Consistency for Knapsack Constraints. CP (2003)
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) (2002)
Meinolf Sellmann, Georg Kliewer, Achim Koberstein
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. ESA (2002)
Meinolf Sellmann
An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. CP (2002)
Torsten Fahle, Meinolf Sellmann
Cost Based Filtering for the Constrained Knapsack Problem. Ann. Oper. Res. 115 (1-4) (2002)
Meinolf Sellmann, Kyriakos Zervoudakis, Panagiotis Stamatopoulos, Torsten Fahle
Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search. Ann. Oper. Res. 115 (1-4) (2002)
Meinolf Sellmann, Warwick Harvey
Heuristic Constraint Propagation. CP (2002)
Meinolf Sellmann, Torsten Fahle
Coupling Variable Fixing Algorithms for the Automatic Recording Problem. ESA (2001)
Torsten Fahle, Stefan Schamberger, Meinolf Sellmann
Symmetry Breaking. CP (2001)
Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo Vaaben, Torsten Fahle, Meinolf Sellmann
A Framework for Constraint Programming Based Column Generation. CP (1999)