The SCEAS System
Navigation Menu

Conferences in DBLP

CPAIOR (cpaior)
2004 (conf/cpaior/2004)

  1. Christos T. Maravelias, Ignacio E. Grossmann
    Using MILP and CP for the Scheduling of Batch Chemical Processes. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:1-20 [Conf]
  2. Ionut D. Aron, John N. Hooker, Tallys H. Yunes
    SIMPL: A System for Integrating Optimization Techniques. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:21-36 [Conf]
  3. Christian Artigues, Sana Belmokhtar, Dominique Feillet
    A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:37-49 [Conf]
  4. J. Christopher Beck, Eugene C. Freuder
    Simple Rules for Low-Knowledge Algorithm Selection. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:50-64 [Conf]
  5. Nicolas Beldiceanu, Irit Katriel, Sven Thiel
    Filtering Algorithms for the Same Constraint. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:65-79 [Conf]
  6. Nicolas Beldiceanu, Thierry Petit
    Cost Evaluation of Soft Global Constraints. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:80-95 [Conf]
  7. Alberto Bemporad, Nicolò Giorgetti
    SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:96-111 [Conf]
  8. Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim
    Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:112-126 [Conf]
  9. Yingyi Chu, Quanshi Xia
    Generating Benders Cuts for a General Class of Integer Programming Problems. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:127-141 [Conf]
  10. Mattias Grönkvist
    A Constraint Programming Model for Tail Assignment. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:142-156 [Conf]
  11. Emmanuel Hebrard, Brahim Hnich, Toby Walsh
    Super Solutions in Constraint Programming. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:157-172 [Conf]
  12. Olli Kamarainen, Hani El Sakkout
    Local Probing Applied to Network Routing. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:173-189 [Conf]
  13. Irit Katriel
    Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:190-199 [Conf]
  14. Waldemar Kocjan, Per Kreuger
    Filtering Methods for Symmetric Cardinality Constraint. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:200-208 [Conf]
  15. Olivier Lhomme
    Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:209-224 [Conf]
  16. Laurent Perron, Paul Shaw
    Combining Forces to Solve the Car Sequencing Problem. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:225-239 [Conf]
  17. Cédric Pralet, Gérard Verfaillie
    Travelling in the World of Local Searches in the Space of Partial Assignments. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:240-255 [Conf]
  18. Cristina Ribeiro, Maria Antónia Carravilla
    A Global Constraint for Nesting Problems. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:256-270 [Conf]
  19. Barbara M. Smith, Karen E. Petrie, Ian P. Gent
    Models and Symmetry Breaking for 'Peaceable Armies of Queens'. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:271-286 [Conf]
  20. Sébastien Sorlin, Christine Solnon
    A Global Constraint for Graph Isomorphism Problems. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:287-302 [Conf]
  21. Armagan Tarim, Ian Miguel
    Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:302-318 [Conf]
  22. Pascal Van Hentenryck, Laurent Michel
    Scheduling Abstractions for Local Search. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:319-334 [Conf]
  23. Petr Vilím
    O(n log n) Filtering Algorithms for Unary Resource Constraint. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:335-347 [Conf]
  24. Quanshi Xia, Andrew Eremin, Mark Wallace
    Problem Decomposition for Traffic Diversions. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:348-363 [Conf]
  25. Gautam Appa, Dimitris Magos, Ioannis Mourtos
    LP Relaxations of Multiple all_different Predicates. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:364-369 [Conf]
  26. Ayoub Insa Corréa, André Langevin, Louis-Martin Rousseau
    Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:370-379 [Conf]
  27. Cormac Gebruers, Alessio Guerri, Brahim Hnich, Michela Milano
    Making Choices Using Structure at the Instance Level within a Case Based Reasoning Framework. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:380-386 [Conf]
  28. 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]
  29. Gerrit Renker, Hatem Ahriz
    Building Models through Formal Specification. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:395-401 [Conf]
  30. Louis-Martin Rousseau
    Stabilization Issues for Constraint Programming Based Column Generation. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:402-408 [Conf]
  31. Ruslan Sadykov
    A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem. [Citation Graph (0, 0)][DBLP]
    CPAIOR, 2004, pp:409-415 [Conf]
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