Integer Programming and Combinatorial Optimization

9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings

By: William J. Cook (Editor), Andreas S. Schulz (Editor)

Write A Review

Paperback | 14 May 2002

At a Glance

Paperback
504 Pages

Dimensions(cm)
24.13 x 15.88 x 2.54

Paperback

$84.99

or 4 interest-free payments of $21.25 with

Ships in 5 to 7 business days

This volume contains the papers selected for presentation at IPCO 2002, the NinthInternationalConferenceonIntegerProgrammingandCombinatorial- timization, Cambridge, MA (USA), May 27-29, 2002. The IPCO series of c- ferences highlights recent developments in theory, computation, and application of integer programming and combinatorial optimization. IPCO was established in 1988 when the ?rst IPCO program committee was formed. IPCO is held every year in which no International Symposium on Ma- ematical Programming (ISMP) takes places. The ISMP is triennial, so IPCO conferences are held twice in every three-year period. The eight previous IPCO conferences were held in Waterloo (Canada) 1990, Pittsburgh (USA) 1992, Erice (Italy) 1993, Copenhagen (Denmark) 1995, Vancouver (Canada) 1996, Houston (USA) 1998, Graz (Austria) 1999, and Utrecht (The Netherlands) 2001. In response to the call for papers for IPCO 2002, the program committee received 110 submissions, a record number for IPCO. The program committee met on January 7 and 8, 2002, in Aussois (France), and selected 33 papers for inclusion in the scienti?c program of IPCO 2002. The selection was based on originality and quality, and re?ects many of the current directions in integer programming and combinatorial optimization research.

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 $79.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.

You Can Find This Book In

Non-Fiction Mathematics Combinatorics & Graph Theory Calculus & Mathematical Analysis Optimisation Linear Programming Computing & I.T.Computer Programming & Software Development Algorithms & Data Structures Computer Science Mathematical Theory of Computation Probability & Statistics

Databases Data Capture & Analysis Applied Mathematics Graphical & Digital Media Applications Software Engineering

A Faster Scaling Algorithm for Minimizing Submodular Functions	p. 1
A Generalization of EdmondsÆ Matching and Matroid Intersection Algorithms	p. 9
A Coordinatewise Domain Scaling Algorithm for M-convex Function Minimization	p. 21
The Quickest Multicommodity Flow Problem	p. 36
A New Min-Cut Max-Flow Ratio for Multicommodity Flows	p. 54
Improved Rounding Techniques for the MAX 2-SAT and MAX DI-CUT Problems	p. 67
Finding the Exact Integrality Gap for Small Traveling Salesman Problems	p. 83
Polynomial-Time Separation of Simple Comb Inequalities	p. 93
A New Approach to Cactus Construction Applied to TSP Support Graphs	p. 109
Split Closure and Intersection Cuts	p. 127
An Exponential Lower Bound on the Length of Some Classes of Branch-and-Cut Proofs	p. 145
Lifted Inequalities for 0-1 Mixed Integer Programming: Basic Theory and Algorithms	p. 161
On a Lemma of Scarf	p. 176
A Short Proof of SeymourÆs Characterization of the Matroids with the Max-Flow Min-Cut Property	p. 188
Integer Programming and Arrovian Social Welfare Functions	p. 194
Integrated Logistics: Approximation Algorithms Combining Facility Location and Network Design	p. 212
The Minimum Latency Problem Is NP-Hard for Weighted Trees	p. 230
An Improved Approximation Algorithm for the Metric Uncapacitated Facility Location Problem	p. 240
A Polyhedral Approach to Surface Reconstruction from Planar Contours	p. 258
The Semidefinite Relaxation of the k-Partition Polytope Is Strong	p. 273
A Polyhedral Study of the Cardinality Constrained Knapsack Problem	p. 291
A PTAS for Minimizing Total Completion Time of Bounded Batch Scheduling	p. 304
An Approximation Scheme for the Two-Stage, Two-Dimensional Bin Packing Problem	p. 315
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes	p. 329
Hard Equality Constrained Integer Knapsacks	p. 350
The Distribution of Values in the Quadratic Assignment Problem	p. 367
A New Subadditive Approach to Integer Programming	p. 384
Improved Approximation Algorithms for Resource Allocation	p. 401
Approximating the Advertisement Placement Problem	p. 415
Algorithms for Minimizing Response Time in Broadcast Scheduling	p. 425
Building Edge-Failure Resilient Networks	p. 439
The Demand Matching Problem	p. 457
The Single-Sink Buy-at-Bulk LP Has Constant Integrality Gap	p. 475
Author Index	p. 487
Table of Contents provided by Publisher. All Rights Reserved.

Integer Programming and Combinatorial Optimization

9th International IPCO Conference, Cambridge, MA, USA, May 27-29, 2002. Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Software Engineering

Deep Learning Applications in Operations Research

Code

2nd Edition - The Hidden Language of Computer Hardware and Software

Building Microservices

Designing Fine-Grained Systems 2nd Edition

The Pragmatic Programmer 2nd edition

your journey to mastery, 20th Anniversary Edition

The Essence of Software Engineering

Semantics With Applications

Advanced Topics in Computer Science

Fundamentals of Software Architecture

A Modern Engineering Approach

Site Reliability Engineering

How Google Runs Production Systems

The Manager`s Path

A Guide for Tech Leaders Navigating Growth and Change

The Staff Engineer's Path

A Guide For Individual Contributors Navigating Growth and Change

Design Patterns

Elements of Reusable Object-Oriented Software

Designing Data-Intensive Applications

Big Ideas Behind Reliable, Scalable, and Maintainable Systems

Software Architecture: The Hard Parts

Modern Trade-Off Analyses for Distributed Architectures

Hacking For Dummies

For Dummies (Computer/Tech)

Architecture Patterns with Python

Enabling Test-Driven Development, Domain-Driven Design, and Event-Driven Microservices

Test-Driven Development with Python

Obey the Testing Goat: Using Django, Selenium, and JavaScript

Git : Pocket Guide

A Working Introduction

Developing Graphics Frameworks with Java and OpenGL

Swim Training Patterns

1st Edition - Plan your Training Sessions with the Power of Mathematics

The Engineering Leader

Strategies for Scaling Teams and Yourself

Learning Modern C++ for Finance

Foundations for Quantitative Programming

Mastering API Architecture

Defining, Connecting, and Securing Distributed Systems and Microservices

Hacker's Delight

User Story Mapping

Discover the Whote Story, Build the Right Product

This product is categorised by