This volume contains the papers selected for presentation at IPCO VII, the Seventh Conference on Integer Programming and Combinatorial Optimization, Graz,Austria,June9{11,1999.Thismeetingisaforumforresearchersandpr- titioners working on various aspects of integer programming and combinatorial optimization. The aim is to present recent developments in theory, compu- tion, and applications of integer programming and combinatorial optimization. Topics include, but are not limited to: approximation algorithms, branch and bound algorithms, computational biology, computational complexity, compu- tional geometry, cutting plane algorithms, diophantine equations, geometry of numbers, graph and network algorithms, integer programming, matroids and submodular functions, on-line algorithms, polyhedral combinatorics, scheduling theory and algorithms, and semide nite programs. IPCO was established in 1988 when the rst IPCO program committee was formed. IPCO I took place in Waterloo (Canada) in 1990, IPCO II was held in Pittsburgh (USA) in 1992, IPCO III in Erice (Italy) 1993, IPCO IV in Cop- hagen (Denmark) 1995, IPCO V in Vancouver (Canada) 1996, and IPCO VI in Houston (USA) 1998.
IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place: 1990, 1992, 1993, 1995,1996,1998,1999,2001,2002,2004,2005,2007,2008,::::::Since the MPS meeting is triennial, IPCO conferences are held twice in everythree-year period. As a rule, in even years IPCO is held somewhere in Northern America, and in odd years it is held somewhere in Europe. In response to the call for papers for IPCO'99, the program committee - ceived99submissions,indicatingastrongandgrowinginterestintheconference.
Reihe
Auflage
Sprache
Verlagsort
Verlagsgruppe
Zielgruppe
Für höhere Schule und Studium
Für Beruf und Forschung
Research
Illustrationen
Maße
Höhe: 235 mm
Breite: 155 mm
Dicke: 26 mm
Gewicht
ISBN-13
978-3-540-66019-4 (9783540660194)
DOI
Schweitzer Klassifikation
Market Split and Basis Reduction: Towards a Solution of the Cornuéjols-Dawande Instances.- Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts.- Solving the Convex Cost Integer Dual Network Flow Problem.- Some Structural and Algorithmic Properties of the Maximum Feasible Subsystem Problem.- Valid Inequalities for Problems with Additive Variable Upper Bounds.- A Min-Max Theorem on Feedback Vertex Sets (Preliminary Version).- On the Separation of Maximally Violated mod-k Cuts.- Improved Approximation Algorithms for Capacitated Facility Location Problems.- Optimal 3-Terminal Cuts and Linear Programming.- Semidefinite Programming Methods for the Symmetric Traveling Salesman Problem.- Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.- Universally Maximum Flow with Piecewise-Constant Capacities.- Critical Extreme Points of the 2-Edge Connected Spannning Subgraph Polytope.- An Orientation Theorem with Parity Conditions.- Parity Constrained k-Edge-Connected Orientations.- Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs.- On the Chvátal Rank of Certain Inequalities.- The Square-Free 2-Factor Problem in Bipartite Graphs.- The m-Cost ATSP.- A Strongly Polynomial Cut Canceling Algorithm for the Submodular Flow Problem.- Edge-Splitting Problems with Demands.- Integral Polyhedra Associated with Certain Submodular Functions Defined on 012-Vectors.- Optimal Compaction of Orthogonal Grid Drawings (Extended Abstract).- On the Number of Iterations for Dantzig-Wolfe Optimization and Packing-Covering Approximation Algorithms.- Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow.- Approximation Algorithms for a Directed Network Design Problem.- Optimizing over AllCombinatorial Embeddings of a Planar Graph (Extended Abstract).- A Fast Algorithm for Computing Minimum 3-Way and 4-Way Cuts.- Scheduling Two Machines with Release Times.- An Introduction to Empty Lattice Simplices.- On Optimal Ear-Decompositions of Graphs.- Gale-Shapley Stable Marriage Problem Revisited: Strategic Issues and Applications (Extended Abstract).- Vertex-Disjoint Packing of Two Steiner Trees: Polyhedra and Branch-and-Cut.
