Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMeinolf Sellmann
Person information
- affiliation: Brown University, Providence, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j16]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: 103918 (2023)- [e3]Meinolf Sellmann, Kevin Tierney:
Learning and Intelligent Optimization - 17th International Conference, LION 17, Nice, France, June 4-8, 2023, Revised Selected Papers. Lecture Notes in Computer Science 14286, Springer 2023, ISBN 978-3-031-44504-0 [contents] - 2022
- [j15]Carlos Ansótegui, Josep Pon, Meinolf Sellmann:
Boosting evolutionary algorithm configuration. Ann. Math. Artif. Intell. 90(7-9): 715-734 (2022) - [c69]Meinolf Sellmann, Tapan Shah:
Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection. ICMLA 2022: 782-787 - [c68]Fynn Schmitt-Ulms, André Hottung, Meinolf Sellmann, Kevin Tierney:
Learning to Solve a Stochastic Orienteering Problem with Time Windows. LION 2022: 108-122 - [i3]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 abs/2201.10453 (2022) - 2021
- [j14]Meinolf Sellmann, Bart Selman:
Zeitenwende - Turn of Eras. AI Mag. 42(1): 3-5 (2021) - [c67]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: 7-24 - [c66]Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney:
PyDGGA: Distributed GGA for Automatic Configuration. SAT 2021: 11-20 - [i2]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 abs/2103.10321 (2021) - 2020
- [c65]Margarita P. Castro, Meinolf Sellmann, Zhaoyuan Yang, Nurali Virani:
Empirical Confidence Models for Supervised Machine Learning. Canadian AI 2020: 105-117 - [c64]Meinolf Sellmann, Kevin Tierney:
Hyper-parameterized Dialectic Search for Non-linear Box-Constrained Optimization with Heterogenous Variable Types. LION 2020: 102-116 - [i1]Meinolf Sellmann, Tapan Shah:
Cost-sensitive Hierarchical Clustering for Dynamic Classifier Selection. CoRR abs/2012.09608 (2020)
2010 – 2019
- 2019
- [c63]Hermann Schichl, Meinolf Sellmann:
Consensual Affine Transformations for Partial Valuation Aggregation. AAAI 2019: 2612-2619 - [c62]Stefan Kuhlemann, Meinolf Sellmann, Kevin Tierney:
Exploiting Counterfactuals for Scalable Stochastic Optimization. CP 2019: 690-708 - 2018
- [c61]Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney:
Self-configuring Cost-Sensitive Hierarchical Clustering with Recourse. CP 2018: 524-534 - [c60]Carlos Ansótegui, Britta Heymann, Josep Pon, Meinolf Sellmann, Kevin Tierney:
Hyper-Reactive Tabu Search for MaxSAT. LION 2018: 309-325 - 2017
- [j13]Meinolf Sellmann:
Meta-Algorithms in Cognitive Computing. IEEE Intell. Syst. 32(4): 35-39 (2017) - [c59]Carlos Ansótegui, Josep Pon, Meinolf Sellmann, Kevin Tierney:
Reactive Dialectic Search Portfolios for MaxSAT. AAAI 2017: 765-772 - [c58]Serdar Kadioglu, Meinolf Sellmann, Markus Wagner:
Learning a Reactive Restart Strategy to Improve Stochastic Search. LION 2017: 109-123 - 2016
- [j12]Carlos Ansótegui, Joel Gabàs, Yuri Malitsky, Meinolf Sellmann:
MaxSAT by improved instance-specific algorithm configuration. Artif. Intell. 235: 26-39 (2016) - [e2]Paola Festa, Meinolf Sellmann, Joaquin Vanschoren:
Learning and Intelligent Optimization - 10th International Conference, LION 10, Ischia, Italy, May 29 - June 1, 2016, Revised Selected Papers. Lecture Notes in Computer Science 10079, Springer 2016, ISBN 978-3-319-50348-6 [contents] - 2015
- [c57]Hermann Schichl, Meinolf Sellmann:
Predisaster Preparation of Transportation Networks. AAAI 2015: 709-715 - [c56]Carlos Ansótegui, Yuri Malitsky, Horst Samulowitz, Meinolf Sellmann, Kevin Tierney:
Model-Based Genetic Algorithms for Algorithm Configuration. IJCAI 2015: 733-739 - 2014
- [c55]André A. Ciré, Serdar Kadioglu, Meinolf Sellmann:
Parallel Restarted Search. AAAI 2014: 842-848 - [c54]Carlos Ansótegui, Yuri Malitsky, Meinolf Sellmann:
MaxSAT by Improved Instance-Specific Algorithm Configuration. AAAI 2014: 2594-2600 - 2013
- [c53]Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Algorithm Portfolios Based on Cost-Sensitive Hierarchical Clustering. IJCAI 2013: 608-614 - [c52]Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Boosting Sequential Solver Portfolios: Knowledge Sharing and Accuracy Prediction. LION 2013: 153-167 - [c51]Horst Samulowitz, Chandra Reddy, Ashish Sabharwal, Meinolf Sellmann:
Snappy: A Simple Algorithm Portfolio. SAT 2013: 422-428 - [e1]Carla P. Gomes, Meinolf Sellmann:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 10th International Conference, CPAIOR 2013, Yorktown Heights, NY, USA, May 18-22, 2013. Proceedings. Lecture Notes in Computer Science 7874, Springer 2013, ISBN 978-3-642-38170-6 [contents] - 2012
- [c50]Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann:
Non-Model-Based Search Guidance for Set Partitioning Problems. AAAI 2012: 493-498 - [c49]Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Parallel SAT Solver Selection and Scheduling. CP 2012: 512-526 - [c48]Yuri Malitsky, Meinolf Sellmann:
Instance-Specific Algorithm Configuration as a Method for Non-Model-Based Portfolio Generation. CPAIOR 2012: 244-259 - [c47]Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Learning Back-Clauses in SAT - (Poster Presentation). SAT 2012: 498-499 - 2011
- [c46]Siddhartha Jain, Ashish Sabharwal, Meinolf Sellmann:
A General Nogood-Learning Framework for Pseudo-Boolean Multi-Valued SAT. AAAI 2011: 48-53 - [c45]Serdar Kadioglu, Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Algorithm Selection and Scheduling. CP 2011: 454-469 - [c44]Serdar Kadioglu, Eoin O'Mahony, Philippe Refalo, Meinolf Sellmann:
Incorporating Variance in Impact-Based Search. CP 2011: 470-477 - [c43]Yuri Malitsky, Ashish Sabharwal, Horst Samulowitz, Meinolf Sellmann:
Non-Model-Based Algorithm Portfolios for SAT. SAT 2011: 369-370 - 2010
- [j11]Serdar Kadioglu, Meinolf Sellmann:
Grammar constraints. Constraints An Int. J. 15(1): 117-144 (2010) - [j10]Yuri Malitsky, Meinolf Sellmann:
Stochastic Offline Programming. Int. J. Artif. Intell. Tools 19(4): 351-371 (2010) - [c42]Yuri Malitsky, Meinolf Sellmann, Radoslaw Szymanek:
Filtering Bounded Knapsack Constraints in Expected Sublinear Time. AAAI 2010: 141-146 - [c41]Siddhartha Jain, Eoin O'Mahony, Meinolf Sellmann:
A Complete Multi-valued SAT Solver. CP 2010: 281-296 - [c40]Siddhartha Jain, Serdar Kadioglu, Meinolf Sellmann:
Upper Bounds on the Number of Solutions of Binary Integer Programs. CPAIOR 2010: 203-218 - [c39]Serdar Kadioglu, Yuri Malitsky, Meinolf Sellmann, Kevin Tierney:
ISAC - Instance-Specific Algorithm Configuration. ECAI 2010: 751-756
2000 – 2009
- 2009
- [j9]Pierre Flener, Justin Pearson, Meinolf Sellmann:
Static and dynamic structural symmetry breaking. Ann. Math. Artif. Intell. 57(1): 37-57 (2009) - [j8]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): 506-538 (2009) - [j7]Gilles Pesant, Meinolf Sellmann, Bernard Gendron:
Special issue on constraint programming. Comput. Oper. Res. 36(8): 2329 (2009) - [j6]Meinolf Sellmann:
Approximated consistency for the automatic recording constraint. Comput. Oper. Res. 36(8): 2341-2347 (2009) - [c38]Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney:
A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. CP 2009: 142-157 - [c37]Christopher Jefferson, Serdar Kadioglu, Karen E. Petrie, Meinolf Sellmann, Stanislav Zivný:
Same-Relation Constraints. CP 2009: 470-485 - [c36]Serdar Kadioglu, Meinolf Sellmann:
Dialectic Search. CP 2009: 486-500 - [c35]Meinolf Sellmann:
On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency. CP 2009: 762-770 - [c34]Bistra Dilkina, Carla P. Gomes, Yuri Malitsky, Ashish Sabharwal, Meinolf Sellmann:
Backdoors to Combinatorial Optimization: Feasibility and Optimality. CPAIOR 2009: 56-70 - [c33]Gilles Pesant, Claude-Guy Quimper, Louis-Martin Rousseau, Meinolf Sellmann:
The Polytope of Context-Free Grammar Constraints. CPAIOR 2009: 223-232 - [c32]Tarik Hadzic, Eoin O'Mahony, Barry O'Sullivan, Meinolf Sellmann:
Enhanced Inference for the Market Split Problem. ICTAI 2009: 716-723 - [c31]Yuri Malitsky, Meinolf Sellmann:
Stochastic Offline Programming. ICTAI 2009: 784-791 - 2008
- [c30]Serdar Kadioglu, Meinolf Sellmann:
Efficient Context-Free Grammar Constraints. AAAI 2008: 310-316 - [c29]Meinolf Sellmann, Serdar Kadioglu:
Dichotomic Search Protocols for Constrained Optimization. CP 2008: 251-265 - [c28]Yuri Malitsky, Meinolf Sellmann, Willem Jan van Hoeve:
Length-Lex Bounds Consistency for Knapsack Constraints. CP 2008: 266-281 - [c27]Daniel S. Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip:
Model Restarts for Structural Symmetry Breaking. CP 2008: 539-544 - [c26]Daniel H. Leventhal, Meinolf Sellmann:
The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. CPAIOR 2008: 142-157 - [c25]Meinolf Sellmann:
The Polytope of Tree-Structured Binary Constraint Satisfaction Problems. CPAIOR 2008: 367-371 - 2007
- [j5]Meinolf Sellmann, Thorsten Gellermann, Robert Wright:
Cost-based Filtering for Shorter Path Constraints. Constraints An Int. J. 12(2): 207-238 (2007) - [c24]Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck:
Propagating Knapsack Constraints in Sublinear Time. AAAI 2007: 231-236 - [c23]Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal:
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. CPAIOR 2007: 275-287 - 2006
- [c22]Meinolf Sellmann, Carlos Ansótegui:
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. AAAI 2006: 1051-1056 - [c21]Meinolf Sellmann:
The Theory of Grammar Constraints. CP 2006: 530-544 - [c20]Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck:
Static and Dynamic Structural Symmetry Breaking. CP 2006: 695-699 - [c19]Daniel S. Heller, Meinolf Sellmann:
Dynamic Symmetry Breaking Restarted. CP 2006: 721-725 - [c18]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 - [c17]Claire Kenyon, Meinolf Sellmann:
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. CPAIOR 2006: 126-138 - 2005
- [c16]Meinolf Sellmann:
Approximated Consistency for the Automatic Recording Problem. CP 2005: 822-826 - [c15]Thorsten Gellermann, Meinolf Sellmann, Robert Wright:
Shorter Path Constraints for the Resource Constrained Shortest Path Problem. CPAIOR 2005: 201-216 - [c14]Meinolf Sellmann, Pascal Van Hentenryck:
Structural Symmetry Breaking. IJCAI 2005: 298-303 - 2004
- [c13]Meinolf Sellmann:
The Practice of Approximated Consistency for Knapsack Constraints. AAAI 2004: 179-184 - [c12]Carla P. Gomes, Meinolf Sellmann:
Streamlined Constraint Reasoning. CP 2004: 274-289 - [c11]Meinolf Sellmann:
Theoretical Foundations of CP-Based Lagrangian Relaxation. CP 2004: 634-647 - [c10]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
- [j4]Meinolf Sellmann, Torsten Fahle:
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Ann. Oper. Res. 118(1-4): 17-33 (2003) - [c9]Meinolf Sellmann:
Approximated Consistency for Knapsack Constraints. CP 2003: 679-693 - [c8]Meinolf Sellmann:
Cost-Based Filtering for Shorter Path Constraints. CP 2003: 694-708 - [c7]Meinolf Sellmann, Norbert Sensen, Larissa Timajev:
Multicommodity Flow Approximation Used for Exact Graph Partitioning. ESA 2003: 752-764 - 2002
- [j3]Torsten Fahle, Meinolf Sellmann:
Cost Based Filtering for the Constrained Knapsack Problem. Ann. Oper. Res. 115(1-4): 73-93 (2002) - [j2]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): 207-225 (2002) - [j1]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) - [c6]Meinolf Sellmann, Warwick Harvey:
Heuristic Constraint Propagation. CP 2002: 738-743 - [c5]Meinolf Sellmann:
An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. CP 2002: 744-749 - [c4]Meinolf Sellmann, Georg Kliewer, Achim Koberstein:
Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. ESA 2002: 845-858 - 2001
- [c3]Torsten Fahle, Stefan Schamberger, Meinolf Sellmann:
Symmetry Breaking. CP 2001: 93-107 - [c2]Meinolf Sellmann, Torsten Fahle:
Coupling Variable Fixing Algorithms for the Automatic Recording Problem. ESA 2001: 134-145
1990 – 1999
- 1999
- [c1]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
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-11-09 20:07 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
