 |
Meinolf Sellmann
Assistant Professor of Computer ScienceContact Information
Contact PagePersonal home page: http://www.cs.brown.edu/~sello/
Research Areas
| Design and Analysis of Algorithms |
| Combinatorial Optimization |
| Theory of Computation |
| Artificial Intelligence |
Research Themes
| Theory and Practice of Computer Science |
Research Topics or Projects
| RobAuCon: Time-Critical Decision Making |
| Constraint Programming |
| Optimization - Hybrid Methods |
| Symmetry Breaking |
| Approximation Algorithms |
| Algorithms for Combinatorial Optimization |
Courses Taught
| CSCI1410 | Introduction to Artificial Intelligence | |
| CSCI1490 | Introduction to Combinatorial Optimization |
Research Interests
While an important aim for Professor Sellmann is to provide actual software systems that can tackle real-world applications efficiently, the abstraction and generalization of originally problem-tailored approaches to standard solution methods that facilitate algorithm design and algorithm engineering for constraint satisfaction and constrained optimization is a key part of his work. Main methodological contributions of his research are the development of Symmetry Breaking by Dominance Detection, Structural Symmetry Breaking, Streamlined Constraint Reasoning, CP-based Column Generation, CP-based Lagrangian Relaxation, and the introduction of associated theoretical notions like Relaxed Consistency and Approximated Consistency.
Selected Publications
Aron, I., Leventhal, D., and Sellmann, M. A Totally Unimodular Description of the Consistent Value Polytope for Binary CSPs. In Proceedings of the Third International Conference on Integration of AI and OR Techniques (CP-AI-OR) (2006), Springer Verlag, pp. 16-28. [ pdf ]
Flener, P., Pearson, J., Sellmann, M., and Van Hentenryck, P. Static and Dynamic Structural Symmetry Breaking. In Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP) (Nantes, France, Sep 2006), Springer, pp. 695-699. [ pdf ]
Kenyon, C., and Sellmann, M. Uncertainty/Time Trade-Offs for Linear and Integer Programming. In Proceedings of the Third International Conference on Integration of AI and OR Techniques (CP-AI-OR) (2006), Springer Verlag, pp. 126-138.
Sellmann, M. The Theory of Grammar Constraints. In Proceedings of the Twelfth International Conference on Principles and Practice of Constraint Programming (CP) (2006), Springer, pp. 530-544. [ pdf ]
Gellermann, T., Sellmann, M., and Wright, R. Shorter Path Constraints for the Resource Constrained Shortest Path Problem. In Proceedings of the Second International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization (CPAIOR) (2005), Springer, pp. 201-216. [ postscript | pdf ]
Sellmann, M. Approximated Consistency for the Automatic Recording Constraint. In Proceedings of the Eleventh International Conference on Principles and Practice of Constraint Programming (CP) (2005), Springer, pp. 822-826. [ postscript | pdf ]
Sellmann, M., and Hentenryck, P. V. Structural Symmetry Breaking. In Proceedings of the 19th International Joint Conference on Artificial Intelligence (IJCAI) (2005), pp. 298-303. [ postscript | pdf ]
Gomes, C., Sellmann, M., van Es, C., and van Es, H. The Challenge of Generating Spatially Balanced Scientific Experiment Designs. In Proceedings of the First International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR) (2004), Springer, pp. 387-394. [ postscript | pdf ]
Gomes, C., and Sellmann, M. Streamlined Constraint Reasoning. In Proceedings of the Tenth International Conference on the Principles and Practice of Constraint Programming (CP) (2004), Springer, pp. 274-287. [ postscript | pdf ]
Sellmann, M. The Practice of Approximated Consistency for Knapsack Constraints. In Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI) (2004), AAAI Press, pp. 179-184. [ postscript | pdf ]
Sellmann, M. Theoretical Foundations of CP-based Largrangian Relaxation. In Proceedings of the Tenth International Conference on the Principles and Practice of Constraint Programming (CP) (2004), Springer, pp. 634-647. [ postscript | pdf ]
Sellmann, M. Approximated Consistency for Knapsack Constraints. In Proceedings of the Ninth International Conference on the Principles and Practices of Contraint Programming (CP) (2003), Springer, pp. 679-693. [ postscript | pdf ]
Sellmann, M. Cost-Based Filtering for Shorter Path Constraints. In Proceedings of the Ninth International Conference on the Principles and Practices of Contraint Programming (CP) (2003), Springer, pp. 694-708. [ postscript | pdf ]
Sellmann, M., and Fahle, T. Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem. Annals of Operations Research (AOR) 118 (2003), 17-33. [ postscript | pdf ]
Sellmann, M., Sensen, N., and Timajev, L. Multicommodity Flow Approximation Used for Exact Graph Partitioning. In Proceedings of the Eleventh Annual European Symposium on Algorithms (ESA) (2003), Springer, pp. 752-764. [ postscript | pdf ]
Fahle, T., and Sellmann, M. Cost-Based Filtering for the Constrained Knapsack Problem. Annals of Operations Research (AOR) 115 (2002), 73-93. [ postscript | pdf ]
Fahle, T., Junker, U., Karisch, S. E., Kohl, N., Sellmann, M., and Vaaben, B. Constraint Programming Based Column Generation for Crew Assignment. Journal of Heuristics (JOH), Kluwer Academic Publishers 8, 1 (2002), 59-81. [ postscript | pdf ]
Sellmann, M. An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. In Proceedings of the Eighth International Conference on the Principles and Practice of Constraint Programming (CP) (2002), Springer. [ postscript | pdf ]
Sellmann, M., Zervoudakis, K., Stamatopoulos, P., and Fahle, T. Crew Assignment via Constraint Programming: Integrating Column Generation and Heuristic Tree Search. Annals of Operations Research (AOR) 115 (2002), 207-225. [ postscript | pdf ]
Sellmann, M., and Harvey, W. Heuristic Constraint Propagation. In Proceedings of the Eighth International Conference on the Principles and Practice of Constraint Programming (CP) (2002), Springer, pp. 738-743. [ postscript | pdf ]
Sellmann, M., Kliewer, G., and Koberstein, A. Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. In Proceedings of the Tenth Annual European Symposium on Algorithms (ESA) (2002), Springer, pp. 845-858. [ postscript | pdf ]
Sellmann, M. Reduction Techniques in Constraint Programming and Combinatorial Optimization. PhD thesis, University of Paderborn, 2002.
Fahle, T., Schamberger, S., and Sellmann, M. Symmetry Breaking. In Proceedings of the Seventh International Conference on the Principles and Practice of Constraint Programming (CP) (2001), Springer, pp. 93-107. [ postscript | pdf ]
Sellmann, M., and Fahle, T. Coupling Variable Fixing Algorithms for the Automatic Recording Problem. In Proceedings of the Ninth Annual European Symposium on Algorithms (ESA) (2001), Springer, pp. 134-145. [ postscript ]
Junker, U., Karisch, S. E., Kohl, N., Vaaben, B., Fahle, T., and Sellmann, M. A Framework for Constraint Programming Based Column Generation. In Proceedings of the Fifth International Conference on the Principles and Practice of Constraint Programming (CP) (1999), Springer, pp. 261-274. [ pdf ]
All publications by Meinolf Sellmann
| Page Owner: Meinolf Sellmann | Last Modified: Mon Aug 20 14:30:39 2007 |