Integer programming and combinatorial optimization. 7th international IPCO conference, Graz, Austria, June 9--11, 1999. Proceedings
The articles of mathematical interest will be reviewed individually. The preceding conference (6th, 1998) has been announced (see Zbl 0891.00030). Indexed articles: \textit{Aardal, Karen; Bixby, Robert E.; Hurkens, Cor A. J.; Lenstra, Arjen K.; Smeltink, Job W.}, Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances, 1-16 [Zbl 0948.90108] \textit{Ageev, Alexander A.; Sviridenko, Maxim I.}, Approximation algorithms for maximum coverage and max cut with given sizes of parts, 17-30 [Zbl 0948.90122] \textit{Ahuja, Ravindra K.; Hochbaum, Dorit S.; Orlin, James B.}, Solving the convex cost integer dual network flow problem, 31-44 [Zbl 0948.90116] \textit{Amaldi, Edoardo; Pfetsch, Marc E.; Trotter, Leslie E. jun.}, Some structural and algorithmic properties of the maximum feasible subsystem problem, 45-59 [Zbl 0978.90067] \textit{Atamtürk, Alper; Nemhauser, George L.; Savelsbergh, Martin W. P.}, Valid inequalities for problems with additive variable upper bounds, 60-72 [Zbl 0954.90007] \textit{Cai, Maocheng; Deng, Xiaotie; Zang, Wenan}, A min-max theorem on feedback vertex sets. (Preliminary version), 73-86 [Zbl 0941.68060] \textit{Caprara, Alberto; Fischetti, Matteo; Letchford, Adam N.}, On the separation of maximally violated mod-\(k\) cuts, 87-98 [Zbl 0955.90094] \textit{Chudak, Fabián A.; Williamson, David P.}, Improved approximation algorithms for capacitated facility location problems, 99-113 [Zbl 0955.90068] \textit{Cunningham, William H.; Tang, Lawrence}, Optimal 3-terminal cuts and linear programming, 114-125 [Zbl 0948.90159] \textit{Cvetković, Dragoš; Čangalović, Mirjana; Kovačević-Vujčić, Vera}, Semidefinite programming methods for the symmetric travelling salesman problem, 126-136 [Zbl 0948.90114] \textit{Eisenbrand, Friedrich; Schulz, Andreas S.}, Bounds on the Chvátal rank of polytopes in the 0/1-cube, 137-150 [Zbl 0963.90075] \textit{Fleischer, Lisa}, Universally maximum flow with piecewise-constant capacities, 151-165 [Zbl 0948.90026] \textit{Fonlupt, Jean; Mahjoub, Ali Ridha}, Critical extreme points of the 2-edge connected spanning subgraph polytope, 166-182 [Zbl 0948.90140] \textit{Frank, András; Jordán, Tibor; Szigeti, Zoltán}, An orientation theorem with parity conditions, 183-190 [Zbl 0948.90141] \textit{Frank, András; Király, Zoltán}, Parity constrained \(k\)-edge-connected orientations, 191-201 [Zbl 0948.90123] \textit{Halperin, Eran; Zwick, Uri}, Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs, 202-217 [Zbl 0948.90154] \textit{Hartmann, Mark; Queyranne, Maurice; Wang, Yaoguang}, On the Chvátal rank of certain inequalities, 218-233 [Zbl 0948.90151] \textit{Hartvigsen, David}, The square-free 2-factor problem in bipartite graphs, 234-241 [Zbl 0948.90142] \textit{Helmberg, Christoph}, The m-cost ATSP, 242-258 [Zbl 0948.90124] \textit{Iwata, Satoru; McCormick, S. Thomas; Shigeno, Maiko}, A strongly polynomial cut canceling algorithm for the submodular flow problem, 259-272 [Zbl 0948.90028] \textit{Jordán, Tibor}, Edge-splitting problems with demands, 273-288 [Zbl 0955.90143] \textit{Kashiwabara, Kenji; Nakamura, Masataka; Takabatake, Takashi}, Integral polyhedra associated with certain submodular functions defined on 012-vectors, 289-303 [Zbl 0948.90150] \textit{Klau, Gunnar W.; Mutzel, Petra}, Optimal compaction of orthogonal grid drawings. (Extended abstract), 304-319 [Zbl 0948.90109] \textit{Klein, Philip; Young, Neal}, On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms, 320-327 [Zbl 0954.90004] \textit{Kolliopoulos, Stavros G.; Stein, Clifford}, Experimental evaluation of approximation algorithms for single-source unsplittable flow, 328-344 [Zbl 0948.90125] \textit{Melkonian, Vardges; Tardos, Éva}, Approximation algorithms for a directed network design problem, 345-360 [Zbl 0948.90126] \textit{Mutzel, Petra; Weiskircher, René}, Optimizing over all combinatorial embeddings of a planar graph. (Extended abstract), 361-376 [Zbl 0948.90144] \textit{Nagamochi, Hiroshi; Ibaraki, Toshihide}, A fast algorithm for computing minimum 3-way and 4-way cuts, 377-390 [Zbl 0948.90145] \textit{Noga, John; Seiden, Steve}, Scheduling two machines with release times, 391-399 [Zbl 0948.90069] \textit{Sebő, András}, An introduction to empty lattice simplices, 400-414 [Zbl 0949.90079] \textit{Szigeti, Zoltán}, On optimal ear-decompositions of graphs, 415-428 [Zbl 0960.05083] \textit{Teo, Chung-Piaw; Sethuraman, Jay; Tan, Wee-Peng}, Gale-Shapley stable marriage problem revisited: Strategic issues and applications. (Extended abstract), 429-438 [Zbl 0965.91004] \textit{Uchoa, Eduardo; Poggi de Aragão, Marcus}, Vertex-disjoint packing of two Steiner trees: Polyhedra and branch-and-cut, 439-452 [Zbl 0948.90152]
scientific article; zbMATH DE number 1296116