The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Meinolf Sellmann: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Meinolf Sellmann
    The Practice of Approximated Consistency for Knapsack Constraints. [Citation Graph (0, 0)][DBLP]
    AAAI, 2004, pp:179-184 [Conf]
  2. Meinolf Sellmann, Carlos Ansótegui
    Disco - Novo - GoGo: Integrating Local Search and Complete Search with Restarts. [Citation Graph (0, 0)][DBLP]
    AAAI, 2006, pp:- [Conf]
  3. Torsten Fahle, Stefan Schamberger, Meinolf Sellmann
    Symmetry Breaking. [Citation Graph (0, 0)][DBLP]
    CP, 2001, pp:93-107 [Conf]
  4. Pierre Flener, Justin Pearson, Meinolf Sellmann, Pascal Van Hentenryck
    Static and Dynamic Structural Symmetry Breaking. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:695-699 [Conf]
  5. Carla P. Gomes, Meinolf Sellmann
    Streamlined Constraint Reasoning. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:274-289 [Conf]
  6. Daniel S. Heller, Meinolf Sellmann
    Dynamic Symmetry Breaking Restarted. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:721-725 [Conf]
  7. Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Bo Vaaben, Torsten Fahle, Meinolf Sellmann
    A Framework for Constraint Programming Based Column Generation. [Citation Graph (0, 0)][DBLP]
    CP, 1999, pp:261-274 [Conf]
  8. Meinolf Sellmann
    An Arc-Consistency Algorithm for the Minimum Weight All Different Constraint. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:744-749 [Conf]
  9. Meinolf Sellmann
    Approximated Consistency for Knapsack Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:679-693 [Conf]
  10. Meinolf Sellmann
    Cost-Based Filtering for Shorter Path Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2003, pp:694-708 [Conf]
  11. Meinolf Sellmann
    Theoretical Foundations of CP-Based Lagrangian Relaxation. [Citation Graph (0, 0)][DBLP]
    CP, 2004, pp:634-647 [Conf]
  12. Meinolf Sellmann
    Approximated Consistency for the Automatic Recording Problem. [Citation Graph (0, 0)][DBLP]
    CP, 2005, pp:822-826 [Conf]
  13. Meinolf Sellmann
    The Theory of Grammar Constraints. [Citation Graph (0, 0)][DBLP]
    CP, 2006, pp:530-544 [Conf]
  14. Meinolf Sellmann, Warwick Harvey
    Heuristic Constraint Propagation. [Citation Graph (0, 0)][DBLP]
    CP, 2002, pp:738-743 [Conf]
  15. Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann
    A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2006, pp:16-28 [Conf]
  16. Thorsten Gellermann, Meinolf Sellmann, Robert Wright
    Shorter Path Constraints for the Resource Constrained Shortest Path Problem. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2005, pp:201-216 [Conf]
  17. Carla P. Gomes, Meinolf Sellmann, Cindy van Es, Harold van Es
    The Challenge of Generating Spatially Balanced Scientific Experiment Designs. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:387-394 [Conf]
  18. Claire Kenyon, Meinolf Sellmann
    Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2006, pp:126-138 [Conf]
  19. Meinolf Sellmann, Torsten Fahle
    Coupling Variable Fixing Algorithms for the Automatic Recording Problem. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:134-145 [Conf]
  20. Meinolf Sellmann, Georg Kliewer, Achim Koberstein
    Lagrangian Cardinality Cuts and Variable Fixing for Capacitated Network Design. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:845-858 [Conf]
  21. Meinolf Sellmann, Norbert Sensen, Larissa Timajev
    Multicommodity Flow Approximation Used for Exact Graph Partitioning. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:752-764 [Conf]
  22. Meinolf Sellmann, Pascal Van Hentenryck
    Structural Symmetry Breaking. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2005, pp:298-303 [Conf]
  23. Torsten Fahle, Ulrich Junker, Stefan E. Karisch, Niklas Kohl, Meinolf Sellmann, Bo Vaaben
    Constraint Programming Based Column Generation for Crew Assignment. [Citation Graph (0, 0)][DBLP]
    J. Heuristics, 2002, v:8, n:1, pp:59-81 [Journal]
  24. Irit Katriel, Meinolf Sellmann, Eli Upfal, Pascal Van Hentenryck
    Propagating Knapsack Constraints in Sublinear Time. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:231-236 [Conf]
  25. Meinolf Sellmann, Luc Mercier, Daniel H. Leventhal
    The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2007, pp:275-287 [Conf]
  26. Meinolf Sellmann, Thorsten Gellermann, Robert Wright
    Cost-based Filtering for Shorter Path Constraints. [Citation Graph (0, 0)][DBLP]
    Constraints, 2007, v:12, n:2, pp:207-238 [Journal]

  27. Efficient Context-Free Grammar Constraints. [Citation Graph (, )][DBLP]


  28. Filtering Bounded Knapsack Constraints in Expected Sublinear Time. [Citation Graph (, )][DBLP]


  29. Length-Lex Bounds Consistency for Knapsack Constraints. [Citation Graph (, )][DBLP]


  30. Dichotomic Search Protocols for Constrained Optimization. [Citation Graph (, )][DBLP]


  31. Model Restarts for Structural Symmetry Breaking. [Citation Graph (, )][DBLP]


  32. On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency. [Citation Graph (, )][DBLP]


  33. Same-Relation Constraints. [Citation Graph (, )][DBLP]


  34. A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. [Citation Graph (, )][DBLP]


  35. Dialectic Search. [Citation Graph (, )][DBLP]


  36. The Accuracy of Search Heuristics: An Empirical Study on Knapsack Problems. [Citation Graph (, )][DBLP]


  37. The Polytope of Tree-Structured Binary Constraint Satisfaction Problems. [Citation Graph (, )][DBLP]


  38. Backdoors to Combinatorial Optimization: Feasibility and Optimality. [Citation Graph (, )][DBLP]


  39. The Polytope of Context-Free Grammar Constraints. [Citation Graph (, )][DBLP]


  40. Upper Bounds on the Number of Solutions of Binary Integer Programs. [Citation Graph (, )][DBLP]


  41. ISAC - Instance-Specific Algorithm Configuration. [Citation Graph (, )][DBLP]


  42. Stochastic Offline Programming. [Citation Graph (, )][DBLP]


  43. Enhanced Inference for the Market Split Problem. [Citation Graph (, )][DBLP]


  44. Static and dynamic structural symmetry breaking. [Citation Graph (, )][DBLP]


  45. Dynamic structural symmetry breaking for constraint satisfaction problems. [Citation Graph (, )][DBLP]


  46. Grammar constraints. [Citation Graph (, )][DBLP]


  47. Approximated consistency for the automatic recording constraint. [Citation Graph (, )][DBLP]


  48. Special issue on constraint programming. [Citation Graph (, )][DBLP]


Search in 0.021secs, Finished in 0.023secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002