Integer programming and combinatorial optimization. 6th international IPCO conference, Houston, TX, USA, June 22--24, 1998. Proceedings (Q1389775)

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éjols, Gérard; Guenin, Bertrand; Margot, François}, 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ő, András}, 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án}, 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ő, András; Szigeti, Zoltán}, An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs, 126-136 [Zbl 0909.90262] \textit{Călinescu, 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án 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án; 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ándor P.; Schepers, Jörg}, New classes of lower bounds for bin packing problems, 257-270 [Zbl 0910.90222] \textit{Ceria, Sebastián; Pataki, Gábor}, Solving integer and disjunctive programs by lift and project, 271-283 [Zbl 0910.90218] \textit{Cornuéjols, Gérard; 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, Éva; 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]