{"entities":{"Q2711432":{"pageid":2722171,"ns":120,"title":"Item:Q2711432","lastrevid":44668077,"modified":"2025-11-24T22:06:51Z","type":"item","id":"Q2711432","labels":{"en":{"language":"en","value":"Constraint programming and large scale discrete optimization. DIMACS workshop, DIMACS Center, Princeton, NJ, USA, September 14--17, 1998"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1590894"}},"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":"Q2711432$A04F5A45-6EFA-44C4-B535-5D28204C1C06","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"5e1626b7d4dd30e99ecbd6111f7b9ffdab5908f1","datavalue":{"value":"0960.00053","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2711432$2A73008A-892E-4607-B10E-1C1BC1F0105D","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"d92d87602b90dd5642e226e76ae8b030e9d151e1","datavalue":{"value":{"time":"+2001-04-24T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q2711432$C71F1334-C002-4EC9-96E7-0704CB718116","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2711432$C347649F-4EA3-4EE6-ACB6-26EECF64DA10","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ed293b811733fa9438a72e1b6ba5680a0d2aac9e","datavalue":{"value":"68-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2711432$3738F3F6-A6FA-4220-B05C-AE1ACC9EB0E1","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ecbbf3779c517fef97ab936b0a129d7ef035b583","datavalue":{"value":"90-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2711432$C7D21A24-D885-4199-84C2-B413323E43FF","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"04edacbe1f476263a2a8d2aa374e212ae6cddd67","datavalue":{"value":"1590894","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q2711432$296B19D9-70ED-435F-88EC-CB7A9AEB2997","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f893aba17fb5fed3a4e7b640d4ed67270e81bcc0","datavalue":{"value":"Princeton, NJ (USA)","type":"string"},"datatype":"string"},"type":"statement","id":"Q2711432$BE52A2BC-C5AB-41D9-A2F6-48F1117A587E","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q2711432$E837660D-E9B4-49F9-AAFA-AB5623CAAFFE","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f7c2172f0a2ed6197400daa3f44dae0d79725b1a","datavalue":{"value":"Workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q2711432$9DCD3588-0014-4490-99C6-2D723B6BE41F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6e79d7d9544f8674fb29070e74056fa0816bb07b","datavalue":{"value":"DIMACS workshop","type":"string"},"datatype":"string"},"type":"statement","id":"Q2711432$221A5402-862C-43E9-BBCF-B91CAD08886D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"36cfceb64a86d89a2cdbe0e21504b0724a6287fb","datavalue":{"value":"Constraint programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q2711432$8DEE63AC-BC79-40E9-B469-D9E552522267","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"f1fc890834cf511e94438ec9625362a8a3709991","datavalue":{"value":"Large scale discrete optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q2711432$2361B303-18AC-4DA4-8F7E-F85A96FF99EF","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":"Q2711432$0705599F-5C95-46C2-B04F-9F739617D89B","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"f0a615a88c98e6bc6d41ce8998bf7bd5621de355","datavalue":{"value":{"text":"Constraint programming and large scale discrete optimization. DIMACS workshop, DIMACS Center, Princeton, NJ, USA, September 14--17, 1998","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q2711432$B2297FF7-7DE3-45D4-9C65-FB3F94BC1ED1","rank":"normal"}],"P200":[{"mainsnak":{"snaktype":"value","property":"P200","hash":"c301d07638d5d4c36354014ab354fe4d57b1f10b","datavalue":{"value":{"entity-type":"item","numeric-id":6767941,"id":"Q6767941"},"type":"wikibase-entityid"},"datatype":"wikibase-item"},"type":"statement","id":"Q2711432$79C62993-9460-496C-B495-3EA55E80FD16","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"af5441697bfab980281f4e0e91af86db80277483","datavalue":{"value":"The articles of this volume will be reviewed individually.NEWLINENEWLINEIndexed articles:NEWLINENEWLINE\\textit{Nareyek, Alexander}, Using global constraints for local search, 9-28 [Zbl 0983.90053]NEWLINENEWLINE\\textit{Voudouris, Christos; Tsang, Edward}, Guided local search joins the elite in discrete optimisation, 29-39 [Zbl 0983.90056]NEWLINENEWLINE\\textit{Zabatta, Fabian}, Multithreaded constraint programming: A hybrid approach, 41-64 [Zbl 0986.68013]NEWLINENEWLINE\\textit{Meyer auf'm Hofe, Harald}, Nurse rostering as constraint satisfaction with fuzzy constraints and inferred control strategies, 67-99 [Zbl 0983.90042]NEWLINENEWLINE\\textit{Pemberton, Joseph C.; Galiber, Flavius III}, A constraint-based approach to satellite scheduling, 101-114 [Zbl 0983.90023]NEWLINENEWLINE\\textit{R\u00e9gin, Jean-Charles}, Minimization of the number of breaks in sports scheduling problems using constraint programming, 115-130 [Zbl 0983.90055]NEWLINENEWLINE\\textit{Smith, Barbara M.; Layfield, Colin J.; Wren, Anthony}, A constraint programming pre-processor for a bus driver scheduling system, 131-148 [Zbl 0983.90043]NEWLINENEWLINE\\textit{Gervet, Carmen}, Large scale combinatorial optimization: A methodological viewpoint, 151-175 [Zbl 0983.90040]","type":"string"},"datatype":"string"},"type":"statement","id":"Q2711432$19285686-7485-4E0B-BAA5-C4C5402990FF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:2711432","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:2711432"}}}}}