Please observe the copyrights held by the various publishers!

2008 | 2007 | 2006 | 2005 | 2004 | 2003 | 2002 | 2001 | 2000 | 1999

  Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck, Magnus Agren
Dynamic Structural Symmetry Breaking for Constraint Satisfaction Problems
Constraints. To appear.

 

  Meinolf Sellmann and Serdar Kadioglu
Dichotomic Search Protocols for Constrained Optimization
Proceedings of the 14th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 5202, pp. 251-265, 2008.

 

  Daniel Heller, Aurojit Panda, Meinolf Sellmann, Justin Yip
Model Restarts for Structural Symmetry Breaking
Proceedings of the 14th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 5202, pp. 539-544, 2008.

 

  Yuri Malitsky, Meinolf Sellmann, Willem-Jan van Hoeve
Length-Lex Bounds Consistency for Knapsack Constraints
Proceedings of the 14th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 5202, pp. 266-281, 2008.

 

  Serdar Kadioglu and Meinolf Sellmann
Efficient Context-Free Grammar Constraints
Proceedings of the 23rd National Conference on Artificial Intelligence (AAAI), pp. 310-316, 2008.

 

  Daniel Leventhal and Meinolf Sellmann
The Accuracy of Search Heuristics
Proceedings the Fifth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS 5015, pp. 142-157, 2008.

 

  Meinolf Sellmann
The Polytope of Tree-Structured Binary Constraint Satisfaction Problems
Proceedings the Fifth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS 5015, pp. 367-371, 2008.

 

  Meinolf Sellmann
Approximated Consistency for the Automatic Recording Constraint
Computers and Operations Research, doi: http://dx.doi.org/10.1016/j.cor.2008.08.009, 2008.

  Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck
Propagating Knapsack Constraints in Sublinear Time
Proceedings of the 22nd National Conference on Artificial Intelligence (AAAI), pp. 231-236, 2007.

 

  Meinolf Sellmann, Luc Mercier, Daniel Leventhal
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width
Proceedings the Fourth International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS 4510, pp. 275-287, 2007.

 

  Meinolf Sellmann, Thorsten Gellermann, Robert Wright
Cost-Based Filtering for Shorter Path Constraints
Constraints. Vol. 12(2), pp. 207-238, 2007.

 

  Harold van Es, Carla Gomes, Meinolf Sellmann, Cindy van Es
Spatially-Balanced Designs for Experiments on Autocorrelated Fields
Geoderma. Vol. 140, pp. 346-352, 2007.

  Meinolf Sellmann
The Theory of Grammar Constraints
Proceedings of the 12th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 4204, pp. 530-544, 2006.

 

  Daniel Heller and Meinolf Sellmann
Dynamic Symmetry Breaking Restarted
Proceedings of the 12th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 4204, pp. 721-725, 2006.

 

  Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck
Static and Dynamic Structural Symmetry Breaking
Proceedings of the 12th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 4204, pp. 695-699, 2006.

 

  Meinolf Sellmann and Carlos Ansotegui
Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts
Proceedings of the 21st National Conference on Artificial Intelligence (AAAI), pp. 1051-1056, 2006.

 

  Ionut Aron, Daniel Leventhal, Meinolf Sellmann
A Totally Unimodular Description of the Consistent Value Polytope for Binary CSPs
Proceedings the Third International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS 3990, pp. 16-28, 2006.

 

  Claire Kenyon and Meinolf Sellmann
Uncertainity/Time Trade-Offs for Linear and Integer Programming
Proceedings the Third International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS 3990, pp. 126-138, 2006.

  Meinolf Sellmann
Approximated Consistency for the Automatic Recording Constraint
Proceedings of the 11th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 3709, pp. 822-826, 2005.

 

  Meinolf Sellmann and Pascal Van Hentenryck
Structural Symmetry Breaking
Nineteenth International Joint Conference on Artificial Intelligence (IJCAI), 2005.

 

  Thorsten Gellermann, Meinolf Sellmann, Robert Wright
Shorter Path Constraints for the Resource Constrained Shortest Path Problem
Proceedings the Second International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS 3524, pp. 201-216, 2005.

  Carla Gomes and Meinolf Sellmann
Streamlined Constraint Reasoning
Proceedings of the 10th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 3258, pp. 274-287, 2004.

 

  Meinolf Sellmann
Theoretical Foundations of CP-based Lagrangian Relaxation
Proceedings of the 10th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 3258, pp. 634-647, 2004.

 

  Meinolf Sellmann
The Practice of Approximated Consistency for Knapsack Constraints
Proceedings of the Nineteenth National Conference on Artificial Intelligence (AAAI), pp. 179-184, 2004.

 

  Carla Gomes, Meinolf Sellmann, Cindy van Es, and Harold van Es
The Challenge of Generating Spatially Balanced Scientific Experiment Designs
Proceedings of the First International Conference on the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR), Springer LNCS 3011, pp. 387-394, 2004.

  Meinolf Sellmann and Torsten Fahle
Constraint Programming Based Lagrangian Relaxation for the Automatic Recording Problem
Annals of Operations Research (AOR). Vol. 118, pp. 17-33, 2003.

 

  Meinolf Sellmann
Approximated Consistency for Knapsack Constraints
Proceedings of the 9th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 2833, pp. 679-693, 2003.

 

  Meinolf Sellmann
Cost-Based Filtering for Shorter Path Constraints
Proceedings of the 9th intern. Conference on the Principles and Practice of Constraint Programming (CP), Springer LNCS 2833, pp. 694-708, 2003.

 

  Meinolf Sellmann, Norbert Sensen, and Larissa Timajev
Multicommodity Flow Approximation used for exact Graph Partitioning
Proceedings of the 11th Annual European Symposium on Algorithms (ESA), Springer LNCS 2832, pp. 752-764, 2003.

2001  top