Integer Programming and Combinatorial Optimization

8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings

By: Karen Aardal (Editor), Bert Gerards (Editor)

Write A Review

Paperback | 30 May 2001

At a Glance

Paperback
440 Pages

Dimensions(cm)
27.94 x 21.59 x 2.26

Paperback

$144.75

or 4 interest-free payments of $36.19 with

Ships in 10 to 15 business days

This volume contains the papers selected for presentation at IPCO VIII, the Eighth Conference on Integer Programming and Combinatorial Optimization, Utrecht, The Netherlands, 2001. This meeting isa forum for researchers and practitioners working on various aspects of integer programming and combi- torial optimization. The aim is to present recent developments in theory, com- tation, and application 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 nit e programs. IPCO was established in 1988 when the rs t IPCO program committee was formed. The locations and years of the seven rs t IPCO conferences were: IPCO I, Waterloo (Canada) 1990, IPCO II, Pittsburgh (USA) 1992, IPCO III, - ice (Italy) 1993, IPCO IV, Copenhagen (Denmark) 1995, IPCO V, Vancouver (Canada) 1996, IPCO VI, Houston (USA) 1998, IPCO VII, Graz (Austria) 1999. IPCO is held every year in which no MPS (Mathematical Programming Society) International Symposium takes place. Since the MPS meeting is triennial, IPCO conferences are held twice in every three-year period. Asa rule, IPCO is held somewhere in Northern America in even years, and somewhere in Europe in odd years.

Shipping

	Standard Shipping	Express Shipping
Metro postcodes:	$9.99	$14.95
Regional postcodes:	$9.99	$14.95
Rural postcodes:	$9.99	$14.95

Orders over $89.00 qualify for free shipping.

How to return your order

At Booktopia, we offer hassle-free returns in accordance with our returns policy. If you wish to return an item, please get in touch with Booktopia Customer Care.

Additional postage charges may be applicable.

Defective items

If there is a problem with any of the items received for your order then the Booktopia Customer Care team is ready to assist you.

For more info please visit our Help Centre.

Two O(log^* k)-Approximation Algorithms for the Asymmetric k-Center Problem	p. 1
Strongly Polynomial Algorithms for the Unsplittable Flow Problem	p. 15
Edge Covers of Setpairs and the Iterative Rounding Method	p. 30
The Asymptotic Performance Ratio of an On-Line Algorithm for Uniform Parallel Machine Scheduling with Release Dates	p. 45
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation	p. 60
On the Rank of Mixed 0,1 Polyhedra	p. 71
Fast 2-Variable Integer Programming	p. 78
Approximating k-Spanner Problems for k > 2	p. 90
A Matroid Generalization of the Stable Matching Polytope	p. 105
A 2-Approximation for Minimum Cost {0,1,2} Vertex Connectivity	p. 115
Combined Connectivity Augmentation and Orientation Problems	p. 130
An Extension of a Theorem of Henneberg and Laman	p. 145
Bisubmodular Function Minimization	p. 160
On the Integrality Gap of a Natural Formulation of the Single-Sink
Buy-at-Bulk Network Design Problem	p. 170
Circuit Mengerian Directed Graphs	p. 185
Integral Polyhedra Related to Even Cycle and Even Cut Matroids	p. 196
A Unified Framework for Obtaining Improved Approximation Algorithms for Maximum Graph Bisection Problems	p. 210
Synthesis of 2-Commodity Flow Networks	p. 226
Bounds for Deterministic Periodic Routing Sequences	p. 236
Cutting Planes for Mixed 0-1 Semidefinite Programs	p. 251
Independence Free Graphs and Vertex Connectivity Augmentation	p. 264
The Throughput of Sequential Testing	p. 280
An Explicit Exact SDP Relaxation for Nonlinear 0-1 Programs	p. 293
Pruning by Isomorphism in Branch-and-Cut	p. 304
Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times	p. 318
Fences Are Futile: On Relaxations for the Linear Ordering Problem	p. 333
Generating Cuts from Multiple-Term Disjunctions	p. 348
A (2=e)-Approximation Algorithm for Generalized Preemptive Open Shop Problem with Minsum Objective	p. 361
Performance Guarantees of Local Search for Multiprocessor Scheduling	p. 370
Connected Joins in Graphs	p. 383
Two NP-Hardness Results for Preemptive Minsum Scheduling of Unrelated Parallel Machines	p. 396
Approximation Algorithms for the Minimum Bends Traveling Salesman Problem	p. 406
Author Index	p. 423
Table of Contents provided by Publisher. All Rights Reserved.

Integer Programming and Combinatorial Optimization

8th International IPCO Conference, Utrecht, The Netherlands, June 13-15, 2001. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Linear Programming

Markov Decision Processes and Reinforcement Learning

Statistical Analysis with R For Dummies

For Dummies (Computer/Tech)

Elementary Linear Algebra

8th Edition - International Metric Edition

Fuzzy Model-Based Sliding Mode Control of Complex Nonlinear Systems

Engineering Mathematics and Operations Research

Advanced Techniques in Tracking and Sensor Management

Theory and Applications

Swarm Optimization for Biomedical Applications

Robust Control Algorithms for Two-link Flexible Manipulators

Nonlinear Workbook, The

Chaos, Fractals, Cellular Automata, Genetic Algorithms, Gene Expression Programming, Support Vector Machine, Wavelets, Hidden Markov Models, Fuzzy Logic With C++, Java And Symbolicc++ Programs (6th Edition)

Advances in Applied Mathematics

Advances in Applied Mathematics

Innovation Decision-Making Under Uncertain Environment

Risk Management Strategies Using Fuzzy Optimization Techniques

Linear Algebra for Localization

Algorithms, Use Cases, and C++ Implementations

Totally Convex Functions for Fixed Points Computation

Applied Optimization

Linear Kinetic Theory and Particle Transport in Stochastic Mixtures

Series on Advances in Mathematics for Applied Sciences

Neural Network for Optimization and Combinatorics

Oscillation Theory of Operator - Differential Equations

Series on Soviet and East European Mathematics

Theory of Oscillations

Series on Optimization

Nonlinear Superconducting Devices and High-TC Materials : Proceedings of the International Conference

Proceedings of the International Conference

Nonlinear Workbook, The

Chaos, Fractals, Cellular Automata, Neural Networks, Genetic Algorithms, Gene Expression Programming, Wavelets, Fuzzy Logic With C++, Java And Symbolic C++ Programs (2nd Edition)

Selected Papers of Alan J. Hoffman : With Commentary

With Commentary

Recent Advances in Nonsmooth Optimization

Combinatorial and Global Optimization

Series on Applied Mathematics

Nonlinear Dynamics : From Lasers to Butterflies

From Lasers to Butterflies

Inequality Theory and Applications

This product is categorised by