1 option
Integer Programming and Combinatorial Optimization : 7th International IPCO Conference, Graz, Austria, June 9-11, 1999, Proceedings / edited by Gerard Cornuejols, Rainer E. Burkard, Gerhard J. Woeginger.
LIBRA Q341 .P7 2004
Available from offsite location
- Format:
- Book
- Series:
- Computer Science (Springer-11645)
- Lecture notes in computer science 0302-9743 ; 1610.
- Lecture Notes in Computer Science, 0302-9743 ; 1610
- Language:
- English
- Subjects (All):
- Discrete mathematics.
- Probabilities.
- Computer programming.
- Algorithms.
- Computer science--Mathematics.
- Computer science.
- Combinatorial analysis.
- Discrete Mathematics.
- Probability Theory and Stochastic Processes.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Combinatorics.
- Local Subjects:
- Discrete Mathematics.
- Probability Theory and Stochastic Processes.
- Programming Techniques.
- Algorithm Analysis and Problem Complexity.
- Discrete Mathematics in Computer Science.
- Combinatorics.
- Physical Description:
- 1 online resource (X, 462 pages).
- Edition:
- First edition 1999.
- Contained In:
- Springer eBooks
- Place of Publication:
- Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 1999.
- System Details:
- text file PDF
- Contents:
- 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.
- Other Format:
- Printed edition:
- ISBN:
- 978-3-540-48777-7
- 9783540487777
- Access Restriction:
- Restricted for use by site license.
The Penn Libraries is committed to describing library materials using current, accurate, and responsible language. If you discover outdated or inaccurate language, please fill out this feedback form to report it and suggest alternative language.