Integer programming and combinatorial optimization : 7th International IPCO Conference, Graz, Austria, June 9-11, 1999 : proceedings /

This book constitutes the refereed proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization, IPCO'99, held in Graz, Austria, in June 1999

Bibliographic Details
Corporate Author: Conference on Integer Programming and Combinatorial Optimization
Other Authors: Burkard, Rainer E, Cornuejols, Gerard, 1950-, Woeginger, Gerhard
Format: Conference Proceeding Book
Language:English
Published: Berlin ; New York : Springer, c1999
Berlin ; New York : [1999]
Series:Lecture notes in computer science ; 1610
Lecture notes in computer science 1610
Lecture notes in computer science 1610
Subjects:
LEADER 09420nam a2200925 a 4500
001 7bf9c2f1-f023-46a1-967a-bea9f73dfd9a
005 20231119000000.0
008 990818t19991999gw a b 101 0 eng
010 |a  99032451  
010 |a 99032451 
010 |a ^^^99032451^ 
020 |a 3540660194 (softcover : alk. paper) 
020 |a 3540660194  |q softcover  |q alkaline paper 
035 |a (CStRLIN)DCLC9932451-B 
035 |a (MdBJ)2096647 
035 |a (OCoLC)41452665  |z (OCoLC)190833633  |z (OCoLC)960134152 
035 |a (OCoLC)41452665 
035 |a (OCoLC)ocm41452665 
035 |a (PU)2603695-penndb-Voyager 
035 |a 2096647 
035 |a 2603695 
035 |a 41452665 
040 |a DLC  |b eng  |c DLC  |d DLC 
040 |a DLC  |b eng  |c DLC  |d NDD 
040 |a DLC  |c DLC  |d DLC 
040 |a DLC  |c DLC  |d OHX 
049 |a JHEE 
049 |a NDHE  |c 1 [D01083982V] 
050 0 0 |a T57.74  |b .C626 1999 
050 0 0 |a T57.74  |b .I54 1999 
072 7 |a QA  |2 lcco 
082 0 0 |a 519.7/7  |2 21 
092 |a 001.64  |b L471, v. 1610 
245 0 0 |a Integer programming and combinatorial optimization :  |b 7th International IPCO Conference, Graz, Austria, June 9-11, 1999 : proceedings /  |c Gérard Cornuéjols, Rainer E. Burkard, Gerhard J. Woeginger (eds.) 
260 |a Berlin ;  |a New York :  |b Springer,  |c c1999 
264 1 |a Berlin ;  |a New York :  |b Springer,  |c [1999] 
264 4 |c ©1999 
300 |a ix, 452 p. :  |b ill. ;  |c 24 cm 
300 |a ix, 452 pages :  |b illustrations ;  |c 24 cm 
336 |a text  |b txt  |2 rdacontent 
337 |a unmediated  |b n  |2 rdamedia 
338 |a volume  |b nc  |2 rdacarrier 
490 1 |a Lecture notes in computer science,  |x 0302-9743 ;  |v 1610 
504 |a Includes bibliographical references and index 
505 0 |a 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 All Combinatorial 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 
520 |a This book constitutes the refereed proceedings of the 7th International Conference on Integer Programming and Combinatorial Optimization, IPCO'99, held in Graz, Austria, in June 1999 
520 |a 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 
520 8 |a The 33 revised full papers presented were carefully reviewed and selected from a total of 99 submissions. Among the topics addressed are theoretical, computational, and application-oriented aspects of approximation algorithms, branch and bound algorithms, computational biology, computational complexity, computational geometry, cutting plane algorithms, diaphantine equations, geometry of numbers, graph and network algorithms, online algorithms, polyhedral combinatorics, scheduling, and semidefinite programs 
650 0 |a Combinatorial analysis 
650 0 |a Combinatorial optimization  |v Congresses 
650 0 |a Computational complexity 
650 0 |a Computer science 
650 0 |a Computer software 
650 0 |a Integer programming  |v Congresses  |0 https://id.loc.gov/authorities/subjects/sh99001533 
650 0 |a Integer programming  |v Congresses 
650 0 |a Mathematical optimization 
650 7 |a Combinatorial optimization  |2 fast 
650 7 |a Integer programming  |2 fast 
655 7 |a Conference papers and proceedings  |2 fast  |0 http://id.worldcat.org/fast/fst01423772 
655 7 |a Conference papers and proceedings  |2 fast 
655 7 |a Conference papers and proceedings  |2 lcgft 
655 7 |a Graz (1999)  |2 swd 
700 1 |a Burkard, Rainer E  |0 http://viaf.org/viaf/sourceID/LC|n80162591 
700 1 |a Burkard, Rainer E 
700 1 |a Cornuejols, Gerard,  |d 1950-  |0 http://viaf.org/viaf/sourceID/LC|n88605445 
700 1 |a Cornuejols, Gerard,  |d 1950- 
700 1 |a Woeginger, Gerhard  |0 http://viaf.org/viaf/sourceID/LC|n97074329 
700 1 |a Woeginger, Gerhard 
711 2 |a Conference on Integer Programming and Combinatorial Optimization  |n (7th :  |d 1999 :  |c Graz, Austria) 
830 0 |a Lecture notes in computer science ;  |v 1610 
830 0 |a Lecture notes in computer science  |v 1610  |x 0302-9743  |0 http://viaf.org/viaf/sourceID/LC|n42015162 
830 0 |a Lecture notes in computer science  |x 0302-9743 ;  |v 1610 
999 1 0 |i 7bf9c2f1-f023-46a1-967a-bea9f73dfd9a  |l 991018677859707861  |s US-MDBJ  |m integer_programming_and_combinatorial_optimization7th_international_ip_____1999_______sprina___________________________________________________________________________p 
999 1 0 |i 7bf9c2f1-f023-46a1-967a-bea9f73dfd9a  |l 990081390160203941  |s US-MH  |m integer_programming_and_combinatorial_optimization7th_international_ip_____1999_______sprina___________________________________________________________________________p 
999 1 0 |i 7bf9c2f1-f023-46a1-967a-bea9f73dfd9a  |l 002603205  |s US-NCD  |m integer_programming_and_combinatorial_optimization7th_international_ip_____1999_______sprina___________________________________________________________________________p 
999 1 0 |i 7bf9c2f1-f023-46a1-967a-bea9f73dfd9a  |l 9926036953503681  |s US-PU  |m integer_programming_and_combinatorial_optimization7th_international_ip_____1999_______sprina___________________________________________________________________________p 
999 1 1 |l 991018677859707861  |s ISIL:US-MDBJ  |t BKS  |a LSC shmoffs  |b 31151037771411  |c T57.74.I54 1999  |d 0  |x jhbooks  |y 23430204220007861  |p LOANABLE 
999 1 1 |l 990081390160203941  |s ISIL:US-MH  |t BKS  |a CAB RD  |b AS2LNL  |c QA75 .L4 vol. 1610  |d 0  |x 01 BOOK  |y 232046075400003941  |p LOANABLE 
999 1 1 |l 002603205  |s ISIL:US-NCD  |t BKS  |a LSC PSV  |b D01083982V   |c 001.64 L471, v. 1610  |d 1  |x BOOK  |y 002603205  |p LOANABLE 
999 1 1 |l 9926036953503681  |s ISIL:US-PU  |t BKS  |a Libra stor  |b 31198026074612  |c T57.74 .I54 1999  |d 0  |x BOOK  |y 23396388620003681  |p LOANABLE