{"entities":{"Q5941725":{"pageid":8118527,"ns":120,"title":"Item:Q5941725","lastrevid":33079776,"modified":"2024-03-20T01:49:40Z","type":"item","id":"Q5941725","labels":{"en":{"language":"en","value":"Integer programming and combinatorial optimization. 8th international IPCO conference, Utrecht, Netherlands, June 13--15, 2001. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1636388"}},"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":"Q5941725$211B7880-490C-45F8-B93E-AB45EBAF92D1","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"3b096bb636d054d0db7d0da896201e6615d04bd5","datavalue":{"value":{"text":"Integer programming and combinatorial optimization. 8th international IPCO conference, Utrecht, Netherlands, June 13--15, 2001. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q5941725$8215AA9D-ED1F-43E8-B13A-E8A2BD89D679","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"b4a237352d5c82bca03154e06188f482a5d78c07","datavalue":{"value":"0967.00091","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941725$F77CD166-6AE3-47F8-A19C-09CCA54CCFD2","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"6a1c7e14ea6dc2cdf8eaf19ba7dbf461418c675b","datavalue":{"value":"10.1007/3-540-45535-3","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941725$5C9CA6B8-92A8-497C-8B99-1462EEC8BD4D","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":"Q5941725$1B3913D5-9549-4F69-9DE1-8FA770AAB361","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"c3190f357053ae1b7a6692b25e4aa81e02b63efa","datavalue":{"value":{"time":"+2001-08-22T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q5941725$8E991BF2-CD01-40F2-B758-3227BC8A8E0E","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"e8b89938b46231fae8a1677275bbcbe52e5d84a6","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding conference (7th, 1999) has been reviewed (see Zbl 0914.00106).  Indexed articles:  \\textit{Archer, Aaron}, Two \\(O(\\log^*k)\\)-approximation algorithms for the asymmetric \\(k\\)-center problem, 1-14 [Zbl 1010.90513]  \\textit{Azar, Yossi; Regev, Oded}, Strongly polynomial algorithms for the unsplittable flow problem, 15-29 [Zbl 1010.90521]  \\textit{Cheriyan, Joseph; Vempala, Santosh}, Edge covers of setpairs and the iterative rounding method, 30-44 [Zbl 1010.90520]  \\textit{Chou, Cheng-Feng Mabel; Queyranne, Maurice; Simchi-Levi, David}, The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates, 45-59 [Zbl 0987.68005]  \\textit{Chudak, Fabi\u00e1n A.; Roughgarden, Tim; Williamson, David P.}, Approximate \\(k\\)-MSTs and \\(k\\)-Steiner trees via the primal-dual method and Lagrangean relaxation, 60-70 [Zbl 0987.68102]  \\textit{Cornu\u00e9jols, G\u00e9rard; Li, Yanjun}, On the rank of mixed 0,1 polyhedra, 71-77 [Zbl 1010.90049]  \\textit{Eisenbrand, Friedrich; Rote, G\u00fcnter}, Fast 2-variable integer programming, 78-89 [Zbl 1010.90048]  \\textit{Elkin, Michael; Peleg, David}, Approximating \\(k\\)-spanner problems for \\(k>2\\), 90-104 [Zbl 0987.68052]  \\textit{Fleiner, Tam\u00e1s}, A matroid generalization of the stable matching polytope, 105-114 [Zbl 1010.90062]  \\textit{Fleischer, Lisa}, A 2-approximation for minimum cost {0,1,2} vertex connectivity, 115-129 [Zbl 1010.90518]  \\textit{Frank, Andr\u00e1s; Kir\u00e1ly, Tam\u00e1s}, Combined connectivity augmentation and orientation problems, 130-144 [Zbl 0988.05055]  \\textit{Frank, Andr\u00e1s; Szeg\u00f6, L\u00e1szl\u00f3}, An extension of a theorem of Henneberg and Laman, 145-159 [Zbl 0988.05078]  \\textit{Fujishige, Satoru; Iwata, Satoru}, Bisubmodular function minimization, 160-169 [Zbl 1010.90512]  \\textit{Garg, Naveen; Khandekar, Rohit; Konjevod, Goran; Ravi, R.; Salman, F. S.}, On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem, 170-184 [Zbl 1010.90522]  \\textit{Guenin, Bertrand}, Circuit Mengerian directed graphs, 185-195 [Zbl 0989.05049]  \\textit{Guenin, Bertrand}, Integral polyhedra related to even cycle and even cut matroids, 196-209 [Zbl 1010.90088]  \\textit{Halperin, Eran; Zwick, Uri}, A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems, 210-225 [Zbl 0989.90126]  \\textit{Hassin, Refael; Levin, Asaf}, Synthesis of 2-commodity flow networks, 226-235 [Zbl 1010.90501]  \\textit{Hordijk, A.; van der Laan, D. A.}, Bounds for deterministic periodic routing sequences, 236-250 [Zbl 1010.90504]  \\textit{Iyengar, G.; \u00c7ezik, M. T.}, Cutting planes for mixed 0-1 semidefinite programs, 251-263 [Zbl 1010.90511]  \\textit{Jackson, Bill; Jord\u00e1n, Tibor}, Independence free graphs and vertex connectivity augmentation, 264-279 [Zbl 0988.05056]  \\textit{Kodialam, Murali S.}, The throughput of sequential testing, 280-292 [Zbl 1010.90510]  \\textit{Lasserre, Jean B.}, An explicit exact SDP relaxation for nonlinear 0-1 programs, 293-303 [Zbl 1010.90515]  \\textit{Margot, Fran\u00e7ois}, Pruning by isomorphism in branch-and-cut, 304-317 [Zbl 1010.90508]  \\textit{Miller, Andrew J.; Nemhauser, George L.; Savelsbergh, Martin W. P.}, Facets, algorithms, and polyhedral characterizations for a multi-item production planning model with setup times, 318-332 [Zbl 1010.90020]  \\textit{Newman, Alantha; Vempala, Santosh}, Fences are futile: On relaxations for the linear ordering problem, 333-347 [Zbl 1010.90042]  \\textit{Perregaard, Michael; Balas, Egon}, Generating cuts from multiple-term disjunctions, 348-360 [Zbl 1010.90043]  \\textit{Queyranne, Maurice; Sviridenko, Maxim}, A \\((2+\\varepsilon)\\)-approximation algorithm for generalized preemptive open shop problem with minsum objective, 361-369 [Zbl 1010.90506]  \\textit{Schuurman, Petra; Vredeveld, Tjark}, Performance guarantees of local search for multiprocessor scheduling, 370-382 [Zbl 0987.68004]  \\textit{Seb\u0151, Andr\u00e1s; Tannier, Eric}, Connected joins in graphs, 383-395 [Zbl 0988.05075]  \\textit{Sitters, Ren\u00e9}, Two NP-hardness results for preemptive minsum scheduling of unrelated parallel machines, 396-405 [Zbl 1010.90025]  \\textit{Stein, Clifford; Wagner, David P.}, Approximation algorithms for the minimum bends traveling salesman problem, 406-421 [Zbl 1010.90519]","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941725$7B517B8E-3BF1-459E-89F6-62F89BCE5E1F","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941725$C8FEC3EC-25A7-4FE0-BAAB-801B2EAC5659","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ecbbf3779c517fef97ab936b0a129d7ef035b583","datavalue":{"value":"90-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941725$E41A03F4-4382-487F-B609-80109D3F8775","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"ca46dd106fad67ba63bd992b1a05a37d11635f95","datavalue":{"value":"1636388","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941725$604F6610-2A42-4F56-BCE0-BED80B3A851D","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"9b24ba4facf1cda464e3147b2cbc93ce740fb5e6","datavalue":{"value":"Utrecht (Netherlands)","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941725$AAFE056C-5EC6-4DC3-AC63-5E7C09DA13AF","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941725$38AF33EE-AA4C-42F5-8447-E32E8949591D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941725$AC9BC8F9-26C4-487D-97F7-53D01DEFB7BD","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e3efffe61ff3f3ce4ef74c4562f833194fe8c2ec","datavalue":{"value":"IPCO conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941725$D524A99A-79A3-4C82-A358-2D32309B8CC4","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6c4538b12e98f1a419b39d4aade81ef5503d5b1e","datavalue":{"value":"Integer programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941725$369C6BCD-DA3E-4070-8953-EF7CA379B01B","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6fd501bec1e4c351a5bb7e183c0156e01d1981e2","datavalue":{"value":"Combinatorial optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q5941725$56720980-A42F-42C8-9865-45943D002F9B","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":"Q5941725$EF87D562-CCE9-479C-8CFA-B5D539710A07","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"2bacaf69a1485c1dcec8c249b1b882549e0a4237","datavalue":{"value":"https://doi.org/10.1007/3-540-45535-3","type":"string"},"datatype":"url"},"type":"statement","id":"Q5941725$8720611B-1C00-49B6-B6F4-F607CBECEE6D","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"6ca65449af138b62338dce87bffcbadf9a91ccb0","datavalue":{"value":"W2505859333","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q5941725$F272AE4B-2410-44B1-B8D8-CD7FA6D9268D","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:5941725","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:5941725"}}}}}