Integer Programming and Combinatorial Optimization

12th International Ipco Conference, Ithaca, Ny, Usa, June 25-27, 2007, Proceedings

By: Matteo Fischetti (Editor), David P. Williamson (Editor)

Write A Review

Paperback | 19 June 2007

At a Glance

Paperback
514 Pages

Dimensions(cm)
23.5 x 15.88 x 3.18

Paperback

$84.99

or 4 interest-free payments of $21.25 with

or

Ships in 5 to 7 business days

This book constitutes the refereed proceedings of the 12th International Conference on Integer Programming and Combinatorial Optimization, IPCO 2007, held in Ithaca, NY, USA, in June 2007.

Among the topics addressed in the 36 revised full papers are approximation algorithms, algorithmic game theory, computational biology, integer programming, polyhedral combinatorics, scheduling theory and scheduling algorithms, as well as semidefinite programs.

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.

More in Algorithms & Data Structures

The Man Who Solved the Market

How Jim Simons Launched the Quant Revolution SHORTLISTED FOR THE FT & MCKINSEY BUSINESS BOOK OF THE YEAR AWARD 2019

Paperback

RRP $26.99

$22.99

15%
OFF

Addiction by Design

Machine Gambling in Las Vegas

Paperback

RRP $39.99

$33.75

16%
OFF

How to Prove It

A Structured Approach

Paperback

RRP $73.95

$70.75

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

Paperback

RRP $131.20

$81.75

38%
OFF

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

Hardcover

RRP $44.99

$37.75

16%
OFF

Introduction to Machine Learning with Python

A Guide for Data Scientists

Paperback

RRP $114.00

$91.20

20%
OFF

Learning Algorithms

A Programmer's Guide to Writing Better Code

Paperback

RRP $152.00

$121.60

20%
OFF

Python for Algorithmic Trading

From Idea to Cloud Deployment

Paperback

RRP $152.00

$121.60

20%
OFF

Code Dependent

Living in the Shadow of AI - Shortlisted for the Women's Prize for Non-Fiction

Paperback

RRP $36.99

$29.75

20%
OFF

Code Dependent : Living in the Shadow of AI - Madhumita Murgia

$325.99

14%
OFF

Fundamentals of Data Structures and Algorithms

Paperback

RRP $158.00

$141.75

10%
OFF

Computational Modelling with Single Prompts

Series in Computational Physics

Hardcover

RRP $112.00

$97.75

13%
OFF

Mathematical Foundations of Deep Learning : Theory and Algorithms - Xiaojing Ye

$271.99

14%
OFF

Data-Driven Modeling & Scientific Computation : Methods for Complex Systems & Big Data - J. Nathan Kutz

$76.75

21%
OFF

Inequalities from two rows of a simplex tableau	p. 1
Cuts for conic mixed-integer programming	p. 16
Sequential-merge facets for two-dimensional group problems	p. 30
Triangle-free simple 2-matchings in subcubic graphs	p. 43
The smoothed number of pareto optimal solutions in bicriteria integer optimization	p. 53
Finding a polytope from its graph in polynomial time	p. 68
Orbitopal fixing	p. 74
New variants of lift-and-project cut generation from the LP tableau : open source implementation and testing	p. 89
Orbital branching	p. 104
Distinct triangle areas in a planar point set	p. 119
Scheduling with precedence constraints of low fractional dimension	p. 130
Approximation algorithms for 2-stage stochastic scheduling problems	p. 145
On integer programming and the branch-width of the constraint matrix	p. 158
Matching problems in polymatroids without double circuits	p. 167
Maximizing a submodular set function subject to a matroid constraint	p. 182
On a generalization of the master cyclic group polyhedron	p. 197
A framework to derive multidimensional superadditive lifting functions and its applications	p. 210
On the exact separation of mixed integer knapsack cuts	p. 225
A faster strongly polynomial time algorithm for submodular function minimization	p. 240
On convex minimization over base polytopes	p. 252
Computational geometric approach to submodular function minimization for multiclass queueing systems	p. 267
Generating multiple solutions for mixed integer programming problems	p. 280
A branch and bound algorithm for max-cut based on combining semidefinite and polyhedral relaxations	p. 295
DINS, a MIP improvement heuristic	p. 310
Mixed-integer vertex covers on bipartite graphs	p. 324
On the MIR closure of polyhedra	p. 337
The intersection of continuous mixing polyhedra and the continuous mixing polyhedron with flows	p. 352
Simple explicit formula for counting lattice points of polyhedra	p. 367
Characterizations of total dual integrality	p. 382
Sign-solvable linear complementarity problems	p. 397
An integer programming approach for linear programs with probabilistic constraints	p. 410
Infrastructure leasing problems	p. 424
Robust combinatorial optimization with exponential scenarios	p. 439
Approximation algorithms for the multi-item capacitated lot-sizing problem via flow-cover inequalities	p. 454
Optimal efficiency guarantees for network design mechanisms	p. 469
The set connector problem in graphs	p. 484
Table of Contents provided by Blackwell. All Rights Reserved.

Integer Programming and Combinatorial Optimization

12th International Ipco Conference, Ithaca, Ny, Usa, June 25-27, 2007, Proceedings

At a Glance

Paperback

Shipping

How to return your order

Defective items

You Can Find This Book In

More in Algorithms & Data Structures

The Man Who Solved the Market

How Jim Simons Launched the Quant Revolution SHORTLISTED FOR THE FT & MCKINSEY BUSINESS BOOK OF THE YEAR AWARD 2019

Addiction by Design

Machine Gambling in Las Vegas

How to Prove It

A Structured Approach

Algorithms in C, Parts 1-4

3rd Edition - Fundamentals, Data Structures, Sorting, Searching

The Delicate Art of Brute Force

How to Compute It When You Can't Solve It

Introduction to Machine Learning with Python

A Guide for Data Scientists

Learning Algorithms

A Programmer's Guide to Writing Better Code

Python for Algorithmic Trading

From Idea to Cloud Deployment

Code Dependent

Living in the Shadow of AI - Shortlisted for the Women's Prize for Non-Fiction

Code Dependent

Living in the Shadow of AI

Reconceiving AI

The World as an Apple or a Blue Orange

Reconceiving AI

The World as an Apple or a Blue Orange

Fundamentals of Data Structures and Algorithms

Fundamentals of Data Structures and Algorithms

Computational Modelling with Single Prompts

Series in Computational Physics

Mathematical Foundations of Deep Learning

Theory and Algorithms

Mathematical Foundations of Deep Learning

Theory and Algorithms

Explainable Artificial Intelligence and Interpretable Machine Learning in Education

A Researcher's Guide to Data Science

Learning-Enabled Autonomous Systems

Control, Verification, and Monitoring

Recursion

Mathematics and Python

The Metaverse

Hype or Hoax?

Social Network Analytics

Empowering Data Engineering with Deep Learning and Large Language Models

Data-Driven Modeling & Scientific Computation

Methods for Complex Systems & Big Data

Hacker's Delight

This product is categorised by