{"entities":{"Q1892691":{"pageid":1903433,"ns":120,"title":"Item:Q1892691","lastrevid":43399902,"modified":"2025-07-25T11:37:12Z","type":"item","id":"Q1892691","labels":{"en":{"language":"en","value":"Integer programming and combinatorial optimization. 4th international IPCO conference, Copenhagen, Denmark, May 29--31, 1995. Proceedings"}},"descriptions":{"en":{"language":"en","value":"scientific article; zbMATH DE number 765449"}},"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":"Q1892691$77B405CC-BEBB-46FB-B791-AF810947F2D5","rank":"normal"}],"P159":[{"mainsnak":{"snaktype":"value","property":"P159","hash":"64229f249f0433126749f81053b3bce3fad1c140","datavalue":{"value":{"text":"Integer programming and combinatorial optimization. 4th international IPCO conference, Copenhagen, Denmark, May 29--31, 1995. Proceedings","language":"en"},"type":"monolingualtext"},"datatype":"monolingualtext"},"type":"statement","id":"Q1892691$AB54E7C9-5118-4BD5-B4C6-5EFE79D82224","rank":"normal"}],"P225":[{"mainsnak":{"snaktype":"value","property":"P225","hash":"a85ad19e2e40b73df23b4d59f58fcb7179c08fb9","datavalue":{"value":"0875.90002","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$DA264A22-6D26-4FDD-B286-1F6E04178E1D","rank":"normal"}],"P27":[{"mainsnak":{"snaktype":"value","property":"P27","hash":"ebe7e833dcc6ca4be091697bff0873f038b93f96","datavalue":{"value":"10.1007/3-540-59408-6","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$69D477EB-B408-46C9-B484-CA2AC8E63883","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":"Q1892691$F5E3C822-CFDB-4053-864A-581E9CEA830F","rank":"normal"}],"P28":[{"mainsnak":{"snaktype":"value","property":"P28","hash":"b690e02db0492f5550ca2dc06d5e2716fac2bd6f","datavalue":{"value":{"time":"+1995-06-19T00:00:00Z","timezone":0,"before":0,"after":0,"precision":11,"calendarmodel":"http://www.wikidata.org/entity/Q1985727"},"type":"time"},"datatype":"time"},"type":"statement","id":"Q1892691$430CB2D6-FEF4-4A2D-8DC8-8C9A9C27D663","rank":"normal"}],"P1448":[{"mainsnak":{"snaktype":"value","property":"P1448","hash":"f0cf8bead0853ce07fe9ef1a33e4952d77075db9","datavalue":{"value":"The articles of this volume will be reviewed individually.  Indexed articles:  \\textit{Frieze, Alan; Jerrum, Mark}, Improved approximation algorithms for MAX \\(k\\)-CUT and MAX BISECTION, 1-13 [Zbl 1135.90420]  \\textit{Even, Guy; Naor, Joseph Seffi; Schieber, Baruch; Sudan, Madhu}, Approximating minimum feedback sets and multi-cuts in directed graphs (extended summary), 14-28 [Zbl 1498.90238]  \\textit{Bertsimas, Dimitris; Teo, Chungpiaw; Vohra, Rakesh}, Nonlinear formulations and improved randomized approximation algorithms for multicut problems, 29-39 [Zbl 1498.90136]  \\textit{Carr, Robert D.}, Separating clique tree and bipartition inequalities in polynomial time, 40-49 [Zbl 1498.90183]  \\textit{M\u00fcller, Rudolf; Schulz, Andreas S.}, The interval order polytope of a digraph, 50-64 [Zbl 1498.05117]  \\textit{Cheng, Eddie; Cunningham, William H.}, Separation problems for the stable set polytope, 65-79 [Zbl 1498.05218]  \\textit{Bienstock, Daniel}, Computational study of a family of mixed-integer quadratic programming problems, 80-94 [Zbl 1498.90140]  \\textit{Pisinger, David}, A minimal algorithm for the bounded knapsack problem, 95-109 [Zbl 1498.90200]  \\textit{Escudero, L. F.; Martello, S.; Toth, P.}, A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems, 110-123 [Zbl 1498.90137]  \\textit{Helmberg, C.; Poljak, S.; Rendl, F.; Wolkowicz, H.}, Combining semidefinite and polyhedral relaxations for integer programs, 124-134 [Zbl 1498.90138]  \\textit{Deng, Xiaotie}, Distributed near-optimal matching, 135-144 [Zbl 1498.90187]  \\textit{Pferschy, Ulrich}, The random linear bottleneck assignment problem, 145-156 [Zbl 1500.90084]  \\textit{Cherkassky, Boris V.; Goldberg, Andrew V.}, On implementing push-relabel method for the maximum flow problem, 157-171 [Zbl 1498.90237]  \\textit{Ali, Agha Iqbal; Han, Hyun-Soo; Kennington, Jeffery L.}, Use of hidden network structure in the set partitioning problem, 172-184 [Zbl 1498.90179]  \\textit{Hartvigsen, David}, Generalized max flows and augmenting paths, 185-197 [Zbl 1498.90239]  \\textit{Kleinschmidt, Peter; Onn, Shmuel}, Oriented matroid polytopes and polyhedral fans are signable, 198-211 [Zbl 1505.05035]  \\textit{Novick, Beth; Seb\u0151, Andr\u00e1s}, On combinatorial properties of binary spaces, 212-227 [Zbl 1498.90197]  \\textit{Bouchet, Andr\u00e9}, Coverings and delta-coverings, 228-243 [Zbl 1498.90182]  \\textit{B\u00e1r\u00e1ny, I.; Scarf, H. E.; Shallcross, D.}, The topological structure of maximal lattice free convex bodies: the general case, 244-251 [Zbl 1498.90135]  \\textit{Laburthe, Fran\u00e7ois}, The Hilbert basis of the cut cone over the complete graph \\(K_6\\), 252-266 [Zbl 1500.90031]  \\textit{Ho\u015ften, Serkan; Sturmfels, Bernd}, GRIN: an implementation of Gr\u00f6bner bases for integer programming, 267-276 [Zbl 07577897]  \\textit{Crama, Yves; Spieksma, Frits C. R.}, Scheduling jobs of equal length: complexity, facets and computational results, 277-291 [Zbl 1500.90016]  \\textit{Hoogeveen, Han; van de Velde, Steef}, Formulating a scheduling problem with almost identical jobs by using positional completion times, 292-306 [Zbl 1500.90017]  \\textit{Queyranne, Maurice; Schulz, Andreas S.}, Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds, 307-320 [Zbl 1500.90018]  \\textit{Conforti, Michele; Cornu\u00e9jols, G\u00e9rard; Kapoor, Ajai; Vu\u0161kovi\u0107, Kristina}, A mickey-mouse decomposition theorem, 321-328 [Zbl 1500.05023]  \\textit{Klinz, Bettina; Woeginger, Gerhard J.}, Minimum cost dynamic flows: the series-parallel case, 329-343 [Zbl 1500.90079]  \\textit{Nobili, Paolo; Sassano, Antonio}, \\((0, \\pm 1)\\) ideal matrices, 344-359 [Zbl 1500.15027]  \\textit{Juvan, Martin; Marin\u010dek, Jo\u017ee; Mohar, Bojan}, Embedding graphs in the torus in linear time, 360-363 [Zbl 1501.05016]  \\textit{Ageev, A. A.; Kostochka, A. V.; Szigeti, Z.}, A characterization of Seymour graphs, 364-372 [Zbl 1501.05010]  \\textit{Bartels, J. Eric; Welsh, Dominic J. A.}, The Markov chain of colourings, 373-387 [Zbl 1501.05005]  \\textit{Gabow, Harold N.; Manu, K. S.}, Packing algorithms for arborescences (and spanning trees) in capacitated graphs, 388-402 [Zbl 1500.90058]  \\textit{Nagamochi, Hiroshi; Ibaraki, Toshihide}, A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem, 403-413 [Zbl 1501.05030]  \\textit{Frank, A.; Jord\u00e1n, T.}, How to make a strongly connected digraph two-connected, 414-425 [Zbl 1501.05012]  \\textit{Dahl, Geir}, Polyhedra and optimization in connection with a weak majorization ordering, 426-437 [Zbl 1500.90027]  \\textit{Ceria, Sebasti\u00e1n; Cornu\u00e9jols, G\u00e9rard; Dawande, Milind}, Combining and strengthening Gomory cuts, 438-451 [Zbl 1500.90087]  \\textit{Gu, Zonghao; Nemhauser, George L.; Savelsbergh, Martin W. P.}, Sequence independent lifting of cover inequalities, 452-461 [Zbl 1500.90030]","type":"string"},"datatype":"string"},"type":"statement","id":"Q1892691$CE29AD3F-4AC3-4396-BF04-AB002EDA3E7D","rank":"normal"}],"P226":[{"mainsnak":{"snaktype":"value","property":"P226","hash":"ecbbf3779c517fef97ab936b0a129d7ef035b583","datavalue":{"value":"90-06","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$F55CA5CC-A9E9-437E-B272-BBB09266A462","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"6f2c17db95e93f9a5a19ff6c68b3a1df8b0c021e","datavalue":{"value":"00B25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$47B42203-0F35-4B03-BE35-CE7DA80FBD4D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"a3ddc499d1e3d182c6eb9b9a58820bb08e8281ef","datavalue":{"value":"65Kxx","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$4879CF5E-61D8-4660-BB21-9E35EBF09A1D","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"1de3565cfd3393000dd87ca545f95ff84d4c1446","datavalue":{"value":"68W10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$703908E9-4F1A-4E15-8964-CAF49D2D567A","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"3feee98fb6a1a95642ba0c6a16390527874922bf","datavalue":{"value":"90C10","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$515361B6-7C99-4D6B-BB47-BA2167C150B9","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"35cb8465ca85ba26995d54be2905dc35556d665c","datavalue":{"value":"90C27","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$5355F225-9886-43FD-9560-DB276B49D0D8","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P226","hash":"fdd9498216d1fd2eff80e5a7d18782b649eb7b2f","datavalue":{"value":"68Q25","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$AB84EFD9-EF3B-4B24-A750-A1435FCDA103","rank":"normal"}],"P1451":[{"mainsnak":{"snaktype":"value","property":"P1451","hash":"e8185cfbca5a8356f404bbcee5c8e7cfee5eb460","datavalue":{"value":"765449","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$9A0808E7-1C93-4A6F-9D67-FBF8DE73409C","rank":"normal"}],"P1450":[{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6c4538b12e98f1a419b39d4aade81ef5503d5b1e","datavalue":{"value":"Integer programming","type":"string"},"datatype":"string"},"type":"statement","id":"Q1892691$1E50D888-081D-49D9-BD62-E576B8991848","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"6fd501bec1e4c351a5bb7e183c0156e01d1981e2","datavalue":{"value":"Combinatorial optimization","type":"string"},"datatype":"string"},"type":"statement","id":"Q1892691$14F444F6-4682-4105-9556-5E29C41E12F7","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"b7ff392de0b2fc6fd66627af89f1a8c737075289","datavalue":{"value":"IPCO","type":"string"},"datatype":"string"},"type":"statement","id":"Q1892691$432CD145-FBEA-4AC4-94AB-B6B774E16B3F","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5d83ae477e518ffecea78688f13a2aaaeca13299","datavalue":{"value":"Conference","type":"string"},"datatype":"string"},"type":"statement","id":"Q1892691$A51AA626-C01C-4DCC-B791-C8116CF00F55","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5c4c4bb5a86a0fdf66f908b603f2f6975f5ef6fc","datavalue":{"value":"Proceedings","type":"string"},"datatype":"string"},"type":"statement","id":"Q1892691$A05068EB-E65C-4F14-8ED2-8BE793A1B959","rank":"normal"},{"mainsnak":{"snaktype":"value","property":"P1450","hash":"5bf536f4f878472585edc0063230901e80d68c8c","datavalue":{"value":"Copenhagen (Denmark)","type":"string"},"datatype":"string"},"type":"statement","id":"Q1892691$45C3A321-ABF2-4AB5-B43E-5D4FC4D1BAA6","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":"Q1892691$58527B8A-9011-44B4-AA22-B16616BA5745","rank":"normal"}],"P205":[{"mainsnak":{"snaktype":"value","property":"P205","hash":"24fec6fc2458820b3b50bf1f313ab973808c3880","datavalue":{"value":"https://doi.org/10.1007/3-540-59408-6","type":"string"},"datatype":"url"},"type":"statement","id":"Q1892691$9F2FF9D7-0988-406F-8E14-E5EF04E76F05","rank":"normal"}],"P388":[{"mainsnak":{"snaktype":"value","property":"P388","hash":"3862497e1441a07554de36c4b46efab5d9d303bb","datavalue":{"value":"W2503020379","type":"string"},"datatype":"external-id"},"type":"statement","id":"Q1892691$C46C19EF-8AB7-4FEE-B660-AC46496E38FF","rank":"normal"}]},"sitelinks":{"mardi":{"site":"mardi","title":"Publication:1892691","badges":[],"url":"https://portal.mardi4nfdi.de/wiki/Publication:1892691"}}}}}