{"entities":{"Q1888945":{"pageid":1899687,"ns":120,"title":"Item:Q1888945","lastrevid":73711353,"modified":"2026-04-14T17:00:19Z","type":"item","id":"Q1888945","labels":{"en":{"language":"en","value":"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."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2120295"}},"aliases":{},"claims":{"P31":[{"mainsnak":{"snaktype":"value","property":"P31","hash":"fd5912e4dab4b881a8eb0eb27e7893fef55176ad","datavalue":{"value":{"entity-type":"item","numeric-id":56887,"id":"Q56887"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1888945$E707D1C3-8791-4D77-8793-B7673F0BA744","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3fa150ea47876771c585f756f4b1acf1fea28a42","datavalue":{"value":{"text":"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.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1888945$89E5280B-EC78-427A-A471-309C0AFD5E25","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"935b88423bb124d1932c2e944e2d2ab4c3b4a7db","datavalue":{"value":"1051.68022","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1888945$9B3BDDBC-9697-45B0-AF5B-DD8DFC70E9ED","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"85c07c7737819bff773f78e2590a3bb761fe677b","datavalue":{"value":{"entity-type":"item","numeric-id":162374,"id":"Q162374"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1888945$33517460-0F1D-4649-9991-D9C9ED70AFCF","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"e178366185acdafcc5b61ed93923a8827b9be7cb","datavalue":{"value":{"time":"+2004-11-29T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1888945$7C291003-18B2-4E34-8F52-2F823CA20766","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"e51db6f8504fcd89f4207fbe91776ec090959f38","datavalue":{"value":"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\u0163; 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\u00f2}, 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\u00f6nkvist, 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\u00e9dric; Verfaillie, G\u00e9rard}, Travelling in the world of local searches in the space of partial assignments, 240-255 [Zbl 1094.68652]  \\textit{Ribeiro, Cristina; Carravilla, Maria Ant\u00f3nia}, 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\u00e9bastien; 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\u00edm, 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\u00e9a, Ayoub Insa; Langevin, Andr\u00e9; 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]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1888945$8CD97452-94AD-4293-9A10-F8E43932CEAD","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1888945$05C804AC-BC60-47D3-BFB3-1BACFF367C9A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1888945$FCFBEB86-57FD-48F9-AA5A-A5BFA54C5C49","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a0dc380a7a6964f00e6560e4112710836960e832","datavalue":{"value":"68T20","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1888945$33D818BA-5228-4A35-BECB-9D3612FBD1BC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1888945$A70D2BB4-CF74-457A-B6BA-FDB2861F32DE","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c85eeb26b033a51dfe892329aec2ab1b0ddbcce5","datavalue":{"value":"2120295","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1888945$86F5CC6A-7554-4CAA-A8A7-5807C95FC8C8","rank":"normal"}],"P1460":[{"mainsnak":{"snaktype":"value","property":"P1460","hash":"57f7fea50d2ce1b39b695c4a1313582eed405e38","datavalue":{"value":{"entity-type":"item","numeric-id":5976449,"id":"Q5976449"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q1888945$AB66AF21-46B6-40AE-8964-FBF2B4677EB8","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"20af30ee8b27e80daf835f3833910d369a26de6e","datavalue":{"value":"https://doi.org/10.1007/b96957","type":"string"},"datatype":"url"},"type":"statement","id":"Q1888945$A694766B-0A23-4743-9C62-18BF141D5724","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"8374056c125483663e57cfb2f4efa0309017d93b","datavalue":{"value":"W2498803556","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1888945$CBA4FD0F-60DE-49B3-872B-384FD24565B6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"d3357b05df3e4c48e97cb63113a5aff6db1f614e","datavalue":{"value":"10.1007/B96957","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1888945$26E3691C-D690-49BF-8063-3DB9BA8CECCD","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"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.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/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."}}}}}