Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. First international conference, CPAIOR 2004, Nice, France, April 20--22, 2004. Proceedings. (Q1888945)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. First international conference, CPAIOR 2004, Nice, France, April 20--22, 2004. Proceedings.
scientific article

    Statements

    Integration of AI and OR techniques in constraint programming for combinatorial optimization problems. First international conference, CPAIOR 2004, Nice, France, April 20--22, 2004. Proceedings. (English)
    0 references
    0 references
    29 November 2004
    0 references
    The articles of this volume will be reviewed individually. Indexed articles: \textit{Maravelias, Christos T.; Grossmann, Ignacio E.}, Using MILP and CP for the scheduling of batch chemical processes, 1-20 [Zbl 1094.90559] \textit{Aron, Ionuţ; Hooker, John N.; Yunes, Tallys H.}, SIMPL: A system for integrating optimization techniques, 21-36 [Zbl 1094.68636] \textit{Artigues, Christian; Belmokhtar, Sana; Feillet, Dominique}, A new exact solution algorithm for the job shop problem with sequence-dependent setup times, 37-49 [Zbl 1094.90553] \textit{Beck, J. Christopher; Freuder, Eugene C.}, Simple rules for low-knowledge algorithm selection, 50-64 [Zbl 1094.90554] \textit{Beldiceanu, Nicolas; Katriel, Irit; Thiel, Sven}, Filtering algorithms for the same constraint, 65-79 [Zbl 1094.68637] \textit{Beldiceanu, Nicolas; Petit, Thierry}, Cost evaluation of soft global constraints, 80-95 [Zbl 1094.68638] \textit{Bemporad, Alberto; Giorgetti, Nicolò}, SAT-based branch \& bound and optimal control of hybrid dynamical systems, 96-111 [Zbl 1094.68639] \textit{Bourdeaud'huy, Thomas; Hanafi, Said; Yim, Pascal}, Solving the Petri nets reachability problem using the logical abstraction technique and mathematical programming, 112-126 [Zbl 1094.68580] \textit{Chu, Yingyi; Xia, Quanshi}, Generating Benders cuts for a general class of integer programming problems, 127-141 [Zbl 1094.90578] \textit{Grönkvist, Mattias}, A constraint programming model for tail assignment, 142-156 [Zbl 1094.68644] \textit{Hebrard, Emmanuel; Hnich, Brahim; Walsh, Toby}, Super solutions in constraint programming, 157-172 [Zbl 1094.68645] \textit{Kamarainen, Olli; El Sakkout, Hani}, Local probing applied to network routing, 173-189 [Zbl 1094.68646] \textit{Katriel, Irit}, Dynamic heaviest paths in DAGs with arbitrary edge weights, 190-199 [Zbl 1094.90582] \textit{Kocjan, Waldemar; Kreuger, Per}, Filtering methods for symmetric cardinality constraint, 200-208 [Zbl 1094.68647] \textit{Lhomme, Olivier}, Arc-consistency filtering algorithms for logical combinations of constraints, 209-224 [Zbl 1094.68648] \textit{Perron, Laurent; Shaw, Paul}, Combining forces to solve the car sequencing problem, 225-239 [Zbl 1094.68651] \textit{Pralet, Cédric; Verfaillie, Gérard}, Travelling in the world of local searches in the space of partial assignments, 240-255 [Zbl 1094.68652] \textit{Ribeiro, Cristina; Carravilla, Maria Antónia}, A global constraint for nesting problems, 256-270 [Zbl 1094.68654] \textit{Smith, Barbara M.; Petrie, Karen E.; Gent, Ian P.}, Models and symmetry breaking for `Peaceable armies of queens', 271-286 [Zbl 1094.68656] \textit{Sorlin, Sébastien; Solnon, Christine}, A global constraint for graph isomorphism problems, 287-301 [Zbl 1094.90585] \textit{Tarim, S. Armagan; Miguel, Ian}, Echelon stock formulation of arborescent distribution systems: An application to the Wagner-Whitin problem, 302-318 [Zbl 1094.90506] \textit{Van Hentenryck, Pascal; Michel, Laurent}, Scheduling abstractions for local search, 319-334 [Zbl 1094.90565] \textit{Vilím, Petr}, \(O(n \log n)\) filtering algorithms for unary resource constraint, 335-347 [Zbl 1094.90566] \textit{Xia, Quanshi; Eremin, Andrew; Wallace, Mark}, Problem decomposition for traffic diversions, 348-363 [Zbl 1094.90515] \textit{Appa, Gautam; Magos, Dimitris; Mourtos, Ioannis}, LP relaxations of multiple all\_different predicates, 364-369 [Zbl 1094.90573] \textit{Corréa, Ayoub Insa; Langevin, André; Rousseau, Louis Martin}, Dispatching and conflict-free routing of automated guided vehicles: A hybrid approach combining constraint programming and mixed integer programming, 370-379 [Zbl 1094.90519] \textit{Gebruers, Cormac; Guerri, Alessio; Hnich, Brahim; Milano, Michela}, Making choices using structure at the instance level within a case based reasoning framework, 380-386 [Zbl 1094.68642] \textit{Gomes, Carla; Sellmann, Meinolf; van Es, Cindy; van Es, Harold}, The challenge of generating spatially balanced scientific experiment designs, 387-394 [Zbl 1094.68643] \textit{Renker, Gerrit; Ahriz, Hatem}, Building models through formal specification, 395-401 [Zbl 1094.68536] \textit{Rousseau, Louis-Martin}, Stabilization issues for constraint programming based column generation, 402-408 [Zbl 1094.68655] \textit{Sadykov, Ruslan}, A hybrid branch-and-cut algorithm for the one-machine scheduling problem, 409-414 [Zbl 1094.90562]
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references