{"entities":{"Q1889609":{"pageid":1900351,"ns":120,"title":"Item:Q1889609","lastrevid":71070111,"modified":"2026-04-13T19:17:06Z","type":"item","id":"Q1889609","labels":{"en":{"language":"en","value":"Integer programming and combinatorial optimization. 10th international IPCO conference, New York, NY, USA, June 7--11, 2004. Proceedings."}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 2121179"}},"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":"Q1889609$9A2474E9-EA34-482F-A6F1-DD6F80C44912","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"44306c5a70a96d3ee365924bff0ba69652af9ab7","datavalue":{"value":{"text":"Integer programming and combinatorial optimization. 10th international IPCO conference, New York, NY, USA, June 7--11, 2004. Proceedings.","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1889609$110948BC-E9DE-4F94-820B-6D678F80E6B1","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"0ca639f9bb4f2cd6859a831f0bc9ef3c22fe229a","datavalue":{"value":"1051.90001","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1889609$77C5F806-3085-4E97-9A60-7DDC50187EDB","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":"Q1889609$39D44704-0A95-41E2-B2FC-67CF2D2BE2A1","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"2d7f475c0171136f1941ae18bf265d1ccf12f7a4","datavalue":{"value":{"time":"+2004-12-06T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1889609$55B0A48A-AB81-4AEA-9B57-6229B8AC6590","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"3f9b46d2b8e308b609d1b48262ff2e4f71d7772e","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding conference has been reviewed (see Zbl 0992.00060).  Indexed articles:  \\textit{Fukasawa, Ricardo; Lysgaard, Jens; Poggi de Arag\u00e3o, Marcus; Reis, Marcelo; Uchoa, Eduardo; Werneck, Renato F.}, Robust branch-and-Cut-and-Price for the capacitated vehicle routing problem, 1-15 [Zbl 1092.90540]  \\textit{Avella, Pasquale; Mattia, Sara; Sassano, Antonio}, Metric inequalities and the network loading problem, 16-32 [Zbl 1092.90006]  \\textit{Dash, Sanjeeb; G\u00fcnl\u00fck, Oktay}, Valid inequalities based on simple mixed-integer sets, 33-45 [Zbl 1092.90032]  \\textit{Perakis, G.}, The price of anarchy when costs are non-separable and asymmetric, 46-58 [Zbl 1092.90012]  \\textit{Correa, Jos\u00e9 R.; Schulz, Andreas S.; Stier Moses, Nicol\u00e1s E.}, Computational complexity, fairness, and the price of anarchy of the maximum latency problem, 59-73 [Zbl 1092.90515]  \\textit{Lozovanu, Dmitrii}, Polynomial time algorithm for determining optimal strategies in cyclic games, 74-85 [Zbl 1092.91011]  \\textit{Bertsimas, Dimitris; Thiele, Aur\u00e9lie}, A robust optimization approach to supply chain management, 86-100 [Zbl 1092.90521]  \\textit{Ravi, R.; Sinha, Amitabh}, Hedging uncertainty: Approximation algorithms for stochastic optimization problems, 101-115 [Zbl 1092.90531]  \\textit{Asgeirsson, Eyjolfur; Berry, Jonathan; Phillips, Cynthia A.; Phillips, David J.; Stein, Cliff; Wein, Joel}, Scheduling an industrial production facility, 116-131 [Zbl 1092.90513]  \\textit{Bessy, St\u00e9phane; Thomass\u00e9, St\u00e9phan}, Three min-max theorems concerning cyclic orders of strong digraphs, 132-138 [Zbl 1093.05504]  \\textit{Pap, Gyula}, A TDI description of restricted 2-matching polytopes, 139-151 [Zbl 1092.90054]  \\textit{Boros, E.; Elbassioni, K.; Gurvich, V.; Khachiyan, L.}, Enumerating minimal dicuts and strongly connected subgraphs and related geometric problems, 152-162 [Zbl 1092.68074]  \\textit{de Farias, I. R. jun.}, Semi-continuous cuts for mixed-integer programming, 163-177 [Zbl 1092.90530]  \\textit{Codato, Gianni; Fischetti, Matteo}, Combinatorial Benders' cuts, 178-195 [Zbl 1092.90529]  \\textit{Letchford, Adam N.; Reinelt, Gerhard; Theis, Dirk Oliver}, A faster exact separation algorithm for blossom inequalities, 196-205 [Zbl 1092.90542]  \\textit{Levi, Retsef; Shmoys, David B.; Swamy, Chaitanya}, LP-based approximation algorithms for capacitated facility location, 206-218 [Zbl 1092.90524]  \\textit{Zhang, Jiawei; Chen, Bo; Ye, Yinyu}, A multi-exchange local search algorithm for the capacitated facility location problem, 219-233 [Zbl 1092.90525]  \\textit{Magnanti, Thomas L.; Stratila, Dan}, Separable concave optimization approximately equals piecewise linear optimization, 234-243 [Zbl 1092.90533]  \\textit{De Loera, J. A.; Haws, D.; Hemmecke, R.; Huggins, P.; Yoshida, R.}, Three kinds of integer programming algorithms based on Barvinok's rational functions, 244-255 [Zbl 1092.90528]  \\textit{Seb\u0151, Andr\u00e1s; Szeg\u0151, L\u00e1szl\u00f3}, The path-packing structure of graphs, 256-270 [Zbl 1093.05512]  \\textit{Lee, Jon; Margot, Fran\u00e7ois}, More on a binary-encoded coloring formulation, 271-282 [Zbl 1093.05503]  \\textit{Correa, Jos\u00e9 R.; Schulz, Andreas S.}, Single machine scheduling with precedence constraints, 283-297 [Zbl 1092.90514]  \\textit{Levin, Asaf; Woeginger, Gerhard J.}, The constrained minimum weighted sum of job completion times problem, 298-307 [Zbl 1092.90517]  \\textit{Vygen, Jens}, Near-optimum global routing with coupling, delay bounds, and power consumption, 308-324 [Zbl 1092.68002]  \\textit{Lang, Kevin; Rao, Satish}, A flow-based method for improving the expansion or conductance of graph cuts, 325-337 [Zbl 1092.68631]  \\textit{De Loera, Jesus; Onn, Shmuel}, All rational polytopes are transportation polytopes and all polytopal integer sets are contingency tables, 338-351 [Zbl 1092.90029]  \\textit{Iwata, Satoru; Moriguchi, Satoko; Murota, Kazuo}, A capacity scaling algorithm for M-convex submodular flow, 352-367 [Zbl 1092.90007]  \\textit{Karzanov, Alexander V.}, Integer concave cocirculations and honeycombs, 368-387 [Zbl 1092.90038]  \\textit{Apollonio, Nicola; Seb\u0151, Andr\u00e1s}, Minsquare factors and maxfix covers of graphs, 388-400 [Zbl 1093.05509]  \\textit{Kaibel, Volker}, Low-dimensional faces of random 0/1-polytopes, 401-415 [Zbl 1092.52005]  \\textit{Kir\u00e1ly, Tam\u00e1s; Makai, M\u00e1rton}, On polyhedra related to even factors, 416-430 [Zbl 1093.05511]  \\textit{Frangioni, Antonio; Lodi, Andrea; Rinaldi, Giovanni}, Optimizing over semimetric polytopes, 431-443 [Zbl 1131.90442]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1889609$A7CEB138-A384-4BC5-9AD3-6D9440209129","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ecbbf3779c517fef97ab936b0a129d7ef035b583","datavalue":{"value":"90-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1889609$7BFD8B98-D585-422E-B78B-BF93C565C2EC","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1889609$D3BDA90C-006E-4615-9B41-23D0C3986AAB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1889609$8CC08DF3-F1F7-4A69-ADE9-964728ED8176","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1889609$7CBCC243-C98B-476E-B737-74A1201D3F7B","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"04a1634be8c7ecd0ee997654e2373cd4a3fea0fd","datavalue":{"value":"2121179","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1889609$DC009845-E334-4B7B-9BF9-A0581198DB17","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":"Q1889609$0DEC427B-597F-4208-9A04-E8E22BC952F6","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"81619bae2f577d49dc0a5368e6780d9fd96daf4e","datavalue":{"value":"https://doi.org/10.1007/b97946","type":"string"},"datatype":"url"},"type":"statement","id":"Q1889609$92D38159-3B77-4912-97D3-E175EC1C507B","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"a804084bdc55a69d1af85130769c45305498318a","datavalue":{"value":"W2484779063","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1889609$7CFB1C83-E791-4704-A609-181DBB755B54","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"8ab4c7b94d6dabccf0e34e317d0f69eac8b02fb3","datavalue":{"value":"10.1007/B97946","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1889609$F4125351-705E-463F-94EA-0850CE343307","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Integer programming and combinatorial optimization. 10th international IPCO conference, New York, NY, USA, June 7--11, 2004. Proceedings.","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Integer_programming_and_combinatorial_optimization._10th_international_IPCO_conference,_New_York,_NY,_USA,_June_7--11,_2004._Proceedings."}}}}}