Meinolf Sellmann's Publications
2009
Flener, P., Pearson, J., Sellmann, M., and Agren, M. Dynamic Structural Symmetry Breaking for Constraint Satisfaction Problems. Constraints 14 (2009).
2008
Heller, D., Panda, A., Sellmann, M., and Yip, J. Model Restarts for Structural Symmetry Breaking. In Fourteenth International Conference on the Principles and Practice of Constraint Programming (CP-2008) (2008), pp. 539-544. [ pdf ]
Kadioglu, S., and Sellmann, M. Efficient Context-Free Grammar Constraints. In AAAI (2008), pp. 310-316. [ pdf ]
Leventhal, D., and Sellmann, M. The Accuracy of Search Heuristics. In Fifth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR) (2008), Springer, pp. 142-157. [ pdf ]
Malitsky, Y., Sellmann, M., and Hoeve, W.-J. Length-Lex Bounds Consistency for Knapsack Constraints. In Fourteenth International Conference on Principles and Practice of Constraint Programming (Sydney, Australia, 2008), pp. 266-281. [ pdf ]
Sellmann, M. Approximated Consistency for the Automatic Recording Constraint. Computers and Operations Research (2008).
Sellmann, M., and Kadioglu, S. Dichotomic Search Protocols for Constrained Optimization. In Fourteenth International Conference on the Principles and Practice of Constraint Programming (CP-2008) (2008), pp. 251-265. [ pdf ]
Sellmann, M. The Polytope of Tree-Structured Binary Constraint Satisfaction Problems. In Fifth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR) (2008), Springer, pp. 367-371. [ pdf ]
2007
Katriel, I., Sellmann, M., Upfal, E., and Hentenryck, P. V. Propagating Knapsack Constraints in Sublinear Time. Twenty-Second Conference on Artificial Intelligence (AAAI'07).
Sellmann, M., Gellermann, T., and Wright, R. Cost-Based Filtering for Shorter Path Constraints. Constraints 12, 2 (2007), 207-238.
Sellmann, M., Mercier, L., and Leventhal, D. The Linear Programming Polytype of Binary Constraint Problems with Bounded Tree-Width. Fourth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS, pp. 275-287.
van Es, H., Gomes, C., Sellmann, M., and van Es, C. Spatially-Balanced Designs for Experiments on Auto-correlated Fields. Geoderma 140 (2007), 346-352.
2006
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, Sept. 2006), Springer, pp. 695-699. [ pdf ]
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 ]
Heller, D., and Sellmann, M. Dynamic Symmetry Breaking Restarted. In Proceedings of the 12th Intern. Conference on the Principles and Practice of Constraint Programming (2006), Springer, pp. 721-725. [ 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., Gellermann, T., and Wright, R. Cost-Based Filtering for Shorter Path Contraints. Constraints (2006).
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 ]
2005
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 ]
2004
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 ]
2003
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 ]
2002
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., and Harvey, W. Heuristic Constraint Propagation. In Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR) (2002).
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.
2001
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. Constraint Programming Based Lagrangian Relaxation for a Multimedia Application. In Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR) (2001).
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 ]
2000
Fahle, T., and Sellmann, M. Constraint Programming Based Column Generation with Knapsack Subproblems. In Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR) (2000).
Sellmann, M., Zervoudakis, K., Stamatopoulos, P., and Fahle, T. Integrating Direct CP Search and CP-based Column Generation for the Airline Crew Assignment Problem. In Proceedings of the International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CP-AI-OR) (2000).
1999
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 ]
| Page Owner: Meinolf Sellmann | Last Modified: Mon Oct 5 12:12:15 2009 |