{"entities":{"Q1389775":{"pageid":1400515,"ns":120,"title":"Item:Q1389775","lastrevid":68603673,"modified":"2026-04-13T00:52:01Z","type":"item","id":"Q1389775","labels":{"en":{"language":"en","value":"Integer programming and combinatorial optimization. 6th international IPCO conference, Houston, TX, USA, June 22--24, 1998. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 1170451"}},"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":"Q1389775$8F2312AA-4730-4D56-9B4C-551AB397C1A0","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"04421a68d1b44aeebcbd382b9704243fd5c03748","datavalue":{"value":{"text":"Integer programming and combinatorial optimization. 6th international IPCO conference, Houston, TX, USA, June 22--24, 1998. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1389775$ECF481B2-F574-41B3-979D-D8AF19C34A34","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"9aa181a584628ff21451e3a92b6b08edd9c9e8a0","datavalue":{"value":"0891.00030","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1389775$0D7A8095-A91F-42DB-BB37-B2155C37FAA6","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"077a42ad35deeb97865bd1df768def63b06f497b","datavalue":{"value":"10.1007/3-540-69346-7","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1389775$4CE36995-FC77-47AB-9748-0AEF1D6225BF","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":"Q1389775$E3233B78-8551-4DBB-9D07-7643DA740366","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"f2c2c7293c0b144623de2383a87e60bd6d031a75","datavalue":{"value":{"time":"+1998-07-01T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1389775$60D30BBD-B1C7-49FC-A046-3B4B853A49A6","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"1a083f0f7fecde75aef25e7b6d312ce40ef22147","datavalue":{"value":"The articles of this volume will be reviewed individually. The preceding conference (5th, 1996) has been reviewed (see Zbl 0851.00088).  Indexed articles:  \\textit{Cornu\u00e9jols, G\u00e9rard; Guenin, Bertrand; Margot, Fran\u00e7ois}, The packing property, 1-8 [Zbl 0909.90263]  \\textit{Guenin, Bertrand}, A characterization of weakly bipartite graphs, 9-22 [Zbl 0909.90264]  \\textit{Gasparyan, Grigor}, Bipartite designs, 23-36 [Zbl 0909.90214]  \\textit{Seb\u0151, Andr\u00e1s}, Characterizing noninteger polyhedra with 0-1 constraints, 37-52 [Zbl 0909.90215]  \\textit{Conforti, Michele; Kapoor, Ajai}, A theorem of Truemper, 53-68 [Zbl 0907.90269]  \\textit{Nakamura, Daishin; Tamura, Akihisa}, The generalized stable set problem for claw-free bidirected graphs, 69-83 [Zbl 0907.90272]  \\textit{Szigeti, Zolt\u00e1n}, On a min-max theorem of cacti, 84-95 [Zbl 0907.90273]  \\textit{Nagamochi, Hiroshi; Eades, Peter}, Edge-splitting and edge-connectivity augmentation in planar graphs, 96-111 [Zbl 0907.90271]  \\textit{Carr, Robert; Ravi, R.}, A new bound for the 2-edge connected subgraph problem, 112-125 [Zbl 0907.90268]  \\textit{Cheriyan, Joseph; Seb\u0151, Andr\u00e1s; Szigeti, Zolt\u00e1n}, An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs, 126-136 [Zbl 0909.90262]  \\textit{C\u0103linescu, Gruia; Fernandes, Cristina G.; Reed, Bruce}, Multicuts in unweighted graphs with bounded degree and bounded tree-width, 137-152 [Zbl 0909.90261]  \\textit{Kolliopoulos, Stavros G.; Stein, Clifford}, Approximating disjoint-path problems using greedy algorithms and packing integer programs, 153-168 [Zbl 0910.90263]  \\textit{Raghavachari, Balaji; Veerasamy, Jeyakesavan}, Approximation algorithms for the mixed postman problem, 169-179 [Zbl 0910.90265]  \\textit{Chudak, Fabi\u00e1n A.}, Improved approximation algorithms for uncapacitated facility location, 180-194 [Zbl 0910.90201]  \\textit{Barvinok, Alexander; Johnson, David S.; Woeginger, Gerhard J.; Woodroofe, Russell}, The maximum traveling salesman problem under polyhedral norms, 195-201 [Zbl 0910.90259]  \\textit{Abeledo, Hern\u00e1n; Atkinson, Gary}, Polyhedral combinatorics of benzenoid problems, 202-212 [Zbl 0914.90266]  \\textit{Christof, Thomas; Oswald, Marcus; Reinelt, Gerhard}, Consecutive ones and a betweenness problem in computational biology, 213-228 [Zbl 0910.90219]  \\textit{Aardal, Karen; Hurkens, Cor; Lenstra, Arjen K.}, Solving a linear diophantine equation with lower and upper bounds on the variables, 229-242 [Zbl 0910.90216]  \\textit{Martin, Alexander; Weismantel, Robert}, The intersection of knapsack polyhedra and extensions, 243-256 [Zbl 0910.90223]  \\textit{Fekete, S\u00e1ndor P.; Schepers, J\u00f6rg}, New classes of lower bounds for bin packing problems, 257-270 [Zbl 0910.90222]  \\textit{Ceria, Sebasti\u00e1n; Pataki, G\u00e1bor}, Solving integer and disjunctive programs by lift and project, 271-283 [Zbl 0910.90218]  \\textit{Cornu\u00e9jols, G\u00e9rard; Dawande, Milind}, A class of hard small 0-1 programs, 284-293 [Zbl 0910.90220]  \\textit{Fleischer, Lisa}, Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time, 294-309 [Zbl 0911.90335]  \\textit{Tardos, \u00c9va; Wayne, Kevin D.}, Simple generalized maximum flow algorithms, 310-324 [Zbl 0911.90156]  \\textit{Hochbaum, Dorit S.}, The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem, 325-337 [Zbl 0911.90154]  \\textit{Goldberg, Andrew V.; Oldham, Jeffrey D.; Plotkin, Serge; Stein, Cliff}, An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow, 338-352 [Zbl 0911.90153]  \\textit{Hoogeveen, Han; Schuurman, Petra; Woeginger, Gerhard J.}, Non-approximability results for scheduling problems with minsum criteria, 353-366 [Zbl 0911.90208]  \\textit{Munier, Alix; Queyranne, Maurice; Schulz, Andreas S.}, Approximation bounds for a general class of precedence constrained parallel machine scheduling problems, 367-382 [Zbl 0911.90215]  \\textit{Chekuri, Chandra; Bender, Michael}, An efficient approximation algorithm for minimizing makespan on uniformly related machines, 383-393 [Zbl 0914.90159]  \\textit{Uma, R. N.; Wein, Joel}, On the relationship between combinatorial and LP-based approaches to NP-hard scheduling problems, 394-408 [Zbl 0910.90179]  \\textit{Kaibel, Volker}, Polyhedral combinatorics of quadratic assignment problems with less objects than locations, 409-422 [Zbl 0910.90238]  \\textit{Helmberg, Christoph; Kiwiel, Krzysztof C.; Rendl, Franz}, Incorporating inequality constraints in the spectral bundle method, 423-435 [Zbl 0910.90215]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1389775$7613721D-8DB1-41BB-BEEC-D52D929B28FC","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1389775$32F28D47-B9E7-44D0-BA89-83F632EE4BA6","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"ecbbf3779c517fef97ab936b0a129d7ef035b583","datavalue":{"value":"90-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1389775$EB0BBEC5-BCF1-411A-A91C-D45F5D916902","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"c60fd4a243dc81d77b134660e881d489a05a6d6b","datavalue":{"value":"1170451","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1389775$3D6092D9-E45A-40BD-A831-0458DE063F69","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"28444ade89646b004394c6bf633d308587c84e44","datavalue":{"value":"Houston, TX (USA)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1389775$5E7E91E8-B5AA-4500-9068-6AECC5E9B8F9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1389775$501D6852-271A-4F23-9267-97E5D1EA2AEB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q1389775$262B9F4B-DC06-4E46-84E9-E6AA6F1EDFE8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"e3efffe61ff3f3ce4ef74c4562f833194fe8c2ec","datavalue":{"value":"IPCO conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q1389775$26864A2F-224E-4F5C-9ABE-14240FAFDEDA","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6c4538b12e98f1a419b39d4aade81ef5503d5b1e","datavalue":{"value":"Integer programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1389775$58C834F6-3BA4-4430-9E8E-EC7788C329DB","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6fd501bec1e4c351a5bb7e183c0156e01d1981e2","datavalue":{"value":"Combinatorial optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1389775$9B6A2048-4CCB-41AF-9938-E151B544E8E4","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":"Q1389775$182212BE-EE07-4133-8E67-D88A69ECA919","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"3958c478686989602f17e5d24c3d7d10164cbcf7","datavalue":{"value":"https://doi.org/10.1007/3-540-69346-7","type":"string"},"datatype":"url"},"type":"statement","id":"Q1389775$17B958C2-D587-4963-AB59-BC55DC956259","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"715934d714bbdb6cbff78070de81889b760af564","datavalue":{"value":"W126628216","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1389775$14917EA0-B502-4ABC-AE3C-547E5CB6AC32","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Integer programming and combinatorial optimization. 6th international IPCO conference, Houston, TX, USA, June 22--24, 1998. Proceedings","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Integer_programming_and_combinatorial_optimization._6th_international_IPCO_conference,_Houston,_TX,_USA,_June_22--24,_1998._Proceedings"}}}}}