Integer programming and combinatorial optimization. 4th international IPCO conference, Copenhagen, Denmark, May 29--31, 1995. Proceedings (Q1892691)

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üller, 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ő, András}, On combinatorial properties of binary spaces, 212-227 [Zbl 1498.90197] \textit{Bouchet, André}, Coverings and delta-coverings, 228-243 [Zbl 1498.90182] \textit{Bárány, 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çois}, The Hilbert basis of the cut cone over the complete graph \(K_6\), 252-266 [Zbl 1500.90031] \textit{Hoşten, Serkan; Sturmfels, Bernd}, GRIN: an implementation of Gröbner 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éjols, Gérard; Kapoor, Ajai; Vušković, 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ček, Jože; 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án, 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án; Cornuéjols, Gérard; 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]