Logo - springer
Slogan - springer

Computer Science - Theoretical Computer Science | Integer Programming and Combinatorial Optimization - 4th International IPCO Conference, Copenhagen,

Integer Programming and Combinatorial Optimization

4th International IPCO Conference, Copenhagen, Denmark, May 29 - 31, 1995. Proceedings

Balas, Egon, Clausen, Jens (Eds.)

1995, X, 474 p.

Available Formats:
eBook
Information

Springer eBooks may be purchased by end-customers only and are sold without copy protection (DRM free). Instead, all eBooks include personalized watermarks. This means you can read the Springer eBooks across numerous devices such as Laptops, eReaders, and tablets.

You can pay for Springer eBooks with Visa, Mastercard, American Express or Paypal.

After the purchase you can directly download the eBook file or read it online in our Springer eBook Reader. Furthermore your eBook will be stored in your MySpringer account. So you can always re-download your eBooks.

 

ISBN 978-3-540-49245-0

digitally watermarked, no DRM

The eBook version of this title will be available soon


learn more about Springer eBooks

add to marked items

Softcover
Information

Softcover (also known as softback) version.

You can pay for Springer Books with Visa, Mastercard, American Express or Paypal.

Standard shipping is free of charge for individual customers.

 
$129.00

(net) price for USA

ISBN 978-3-540-59408-6

free shipping for individuals worldwide

usually dispatched within 3 to 5 business days


add to marked items

This volume constitutes the proceedings of the Fourth International Conference on Integer Programming and Combinatorial Optimization, IPCO '95, held in Copenhagen in May 1995 under the sponsorship of the Mathematical Programming Society.
Integer programming and combinatorial optimization provide a fruitful theoretical and algorithmic basis for the solution of a number of optimization problems occuring in real-world situations, such as production planning and scheduling, routing, crew scheduling, or network construction. This volume presents 36 revised papers selected from a total of 105 submissions and offers a representative up-to-date snapshot on the state of the art in this interdisciplinary area of research and applications.

Content Level » Research

Keywords » Algorithms - CombinatoriaL Optimization - Integer-Programming - Kombinatorische Optimierung - Mathematial Programming - Optimerungsalgorithmen - Optimization Algorithms - Polyhedral - algorithm - optimization - programming

Related subjects » Applications - Computational Science & Engineering - Probability Theory and Stochastic Processes - Theoretical Computer Science

Table of contents 

Improved approximation algorithms for MAX k-CUT and MAX BISECTION.- Approximating minimum feedback sets and multi-cuts in directed graphs.- Nonlinear formulations and improved randomized approximation algorithms for multicut problems.- Separating clique tree and bipartition inequalities in polynomial time.- The interval order polytope of a digraph.- Separation problems for the stable set polytope.- Computational study of a family of mixed-integer quadratic programming problems.- A minimal algorithm for the Bounded Knapsack Problem.- A framework for tightening 0–1 programs based on extensions of pure 0–1 KP and SS problems.- Combining semidefinite and polyhedral relaxations for integer programs.- Distributed near-optimal matching.- The random linear bottleneck assignment problem.- On implementing push-relabel method for the maximum flow problem.- Use of hidden network structure in the set partitioning problem.- Generalized max flows and augmenting paths.- Oriented matroid polytopes and polyhedral fans are signable.- On combinatorial properties of binary spaces.- Coverings and delta-coverings.- The topological structure of maximal lattice free convex bodies: The general case.- The Hilbert basis of the cut cone over the complete graph K 6.- GRIN: An implementation of Gröbner bases for integer programming.- Scheduling jobs of equal length: Complexity, facets and computational results.- Formulating a scheduling problem with almost identical jobs by using positional completion times.- Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds.- A mickey-mouse decomposition theorem.- Minimum cost dynamic flows: The series-parallel case.- (0, ±1) ideal matrices.- Embedding graphs in the torus in linear time.- A characterization of Seymour graphs.- The Markov chain of colourings.- Packing algorithms for arborescences (and spanning trees) in capacitated graphs.- A faster edge splitting algorithm in multigraphs and its application to the edge-connectivity augmentation problem.- How to make a strongly connected digraph two-connected.- Polyhedra and optimization in connection with a weak majorization ordering.- Combining and strengthening Gomory cuts.- Sequence independent lifting of cover inequalities.

Popular Content within this publication 

 

Articles

Read this Book on Springerlink

Services for this book

New Book Alert

Get alerted on new Springer publications in the subject area of Theory of Computation.