Meinolf Sellmann

Affiliations:
  • Brown University, Providence, USA


According to our database1, Meinolf Sellmann authored at least 84 papers between 1999 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2022
The First AI4TSP Competition: Learning to Solve Stochastic Routing Problems.
CoRR, 2022

Boosting evolutionary algorithm configuration.
Ann. Math. Artif. Intell., 2022

2021
Learning How to Optimize Black-Box Functions With Extreme Limits on the Number of Function Evaluations.
CoRR, 2021

Zeitenwende - Turn of Eras.
AI Mag., 2021

PyDGGA: Distributed GGA for Automatic Configuration.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2021, 2021

Learning to Optimize Black-Box Functions with Extreme Limits on the Number of Function Evaluations.
Proceedings of the Learning and Intelligent Optimization - 15th International Conference, 2021

2020
Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection.
CoRR, 2020

Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types.
Proceedings of the Learning and Intelligent Optimization - 14th International Conference, 2020

Empirical Confidence Models for Supervised Machine Learning.
Proceedings of the Advances in Artificial Intelligence, 2020

2019
Exploiting Counterfactuals for Scalable Stochastic Optimization.
Proceedings of the Principles and Practice of Constraint Programming, 2019

Consensual Affine Transformations for Partial Valuation Aggregation.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Hyper-Reactive Tabu Search for MaxSAT.
Proceedings of the Learning and Intelligent Optimization - 12th International Conference, 2018

Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse.
Proceedings of the Principles and Practice of Constraint Programming, 2018

2017
Meta-Algorithms in Cognitive Computing.
IEEE Intell. Syst., 2017

Learning a Reactive Restart Strategy to Improve Stochastic Search.
Proceedings of the Learning and Intelligent Optimization - 11th International Conference, 2017

Reactive Dialectic Search Portfolios for MaxSAT.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
MaxSAT by improved instance-specific algorithm configuration.
Artif. Intell., 2016

2015
Model-Based Genetic Algorithms for Algorithm Configuration.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Predisaster Preparation of Transportation Networks.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Parallel Restarted Search.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

MaxSAT by Improved Instance-Specific Algorithm Configuration.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Snappy: A Simple Algorithm Portfolio.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2013, 2013

Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction.
Proceedings of the Learning and Intelligent Optimization - 7th International Conference, 2013

Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering.
Proceedings of the IJCAI 2013, 2013

2012
Learning Back-Clauses in SAT - (Poster Presentation).
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2012, 2012

Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation.
Proceedings of the Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems, 2012

Parallel SAT Solver Selection and Scheduling.
Proceedings of the Principles and Practice of Constraint Programming, 2012

Non-Model-Based Search Guidance for Set Partitioning Problems.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
Non-Model-Based Algorithm Portfolios for SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2011, 2011

Incorporating Variance in Impact-Based Search.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

Algorithm Selection and Scheduling.
Proceedings of the Principles and Practice of Constraint Programming - CP 2011, 2011

A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT.
Proceedings of the Twenty-Fifth AAAI Conference on Artificial Intelligence, 2011

2010
Stochastic Offline Programming.
Int. J. Artif. Intell. Tools, 2010

Grammar constraints.
Constraints An Int. J., 2010

ISAC - Instance-Specific Algorithm Configuration.
Proceedings of the ECAI 2010, 2010

Upper Bounds on the Number of Solutions of Binary Integer Programs.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2010

A Complete Multi-valued SAT Solver.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

Filtering Bounded Knapsack Constraints in Expected Sublinear Time.
Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009
Approximated consistency for the automatic recording constraint.
Comput. Oper. Res., 2009

Special issue on constraint programming.
Comput. Oper. Res., 2009

Dynamic structural symmetry breaking for constraint satisfaction problems.
Constraints An Int. J., 2009

Static and dynamic structural symmetry breaking.
Ann. Math. Artif. Intell., 2009

Enhanced Inference for the Market Split Problem.
Proceedings of the ICTAI 2009, 2009

The Polytope of Context-Free Grammar Constraints.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

Backdoors to Combinatorial Optimization: Feasibility and Optimality.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency.
Proceedings of the Principles and Practice of Constraint Programming, 2009

Dialectic Search.
Proceedings of the Principles and Practice of Constraint Programming, 2009

Same-Relation Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2009

A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms.
Proceedings of the Principles and Practice of Constraint Programming, 2009

2008
The Polytope of Tree-Structured Binary Constraint Satisfaction Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Dichotomic Search Protocols for Constrained Optimization.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Length-Lex Bounds Consistency for Knapsack Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Model Restarts for Structural Symmetry Breaking.
Proceedings of the Principles and Practice of Constraint Programming, 2008

Efficient Context-Free Grammar Constraints.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Cost-based Filtering for Shorter Path Constraints.
Constraints An Int. J., 2007

The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2007

Propagating Knapsack Constraints in Sublinear Time.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006

A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2006

The Theory of Grammar Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Dynamic Symmetry Breaking Restarted.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Static and Dynamic Structural Symmetry Breaking.
Proceedings of the Principles and Practice of Constraint Programming, 2006

Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts.
Proceedings of the Proceedings, 2006

2005
Structural Symmetry Breaking.
Proceedings of the IJCAI-05, Proceedings of the Nineteenth International Joint Conference on Artificial Intelligence, Edinburgh, Scotland, UK, July 30, 2005

Shorter Path Constraints for the Resource Constrained Shortest Path Problem.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2005

Approximated Consistency for the Automatic Recording Problem.
Proceedings of the Principles and Practice of Constraint Programming, 2005

2004
The Challenge of Generating Spatially Balanced Scientific Experiment Designs.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2004

Theoretical Foundations of CP-Based Lagrangian Relaxation.
Proceedings of the Principles and Practice of Constraint Programming, 2004

Streamlined Constraint Reasoning.
Proceedings of the Principles and Practice of Constraint Programming, 2004

The Practice of Approximated Consistency for Knapsack Constraints.
Proceedings of the Nineteenth National Conference on Artificial Intelligence, 2004

2003
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem.
Ann. Oper. Res., 2003

Multicommodity Flow Approximation Used for Exact Graph Partitioning.
Proceedings of the Algorithms, 2003

Cost-Based Filtering for Shorter Path Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2003

Approximated Consistency for Knapsack Constraints.
Proceedings of the Principles and Practice of Constraint Programming, 2003

2002
Constraint Programming Based Column Generation for Crew Assignment.
J. Heuristics, 2002

Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search.
Ann. Oper. Res., 2002

Cost Based Filtering for the Constrained Knapsack Problem.
Ann. Oper. Res., 2002

Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design.
Proceedings of the Algorithms, 2002

Heuristic Constraint Propagation.
Proceedings of the Principles and Practice of Constraint Programming, 2002

An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2001
Coupling Variable Fixing Algorithms for the Automatic Recording Problem.
Proceedings of the Algorithms, 2001

Symmetry Breaking.
Proceedings of the Principles and Practice of Constraint Programming, 2001

1999
A Framework for Constraint Programming Based Column Generation.
Proceedings of the Principles and Practice of Constraint Programming, 1999


  Loading...