Contraction-based Separation and Lifting for Solving the Max-Cut Problem SIEVERSMEDIEN
Contraction-based Separation and Lifting for Solving the Max-Cut Problem SIEVERSMEDIEN
Contraction-based Separation and Lifting for Solving the Max-Cut Problem SIEVERSMEDIEN

Contraction-based Separation and Lifting for Solving the Max-Cut Problem

  • Brand: Bonato, Dr. Thorsten
  • Availability: In stock
  • SKU: 9783941274860

€49,90

The max-cut problem is an NP-hard combinatorial optimization problem defined on undirected weighted graphs. It consists in finding a subset of the graph's nodes such that the aggregate weight of the edges between the subset and its complement is maximized. This book deals with a new separation approach to be...

variant

The max-cut problem is an NP-hard combinatorial optimization problem defined on undirected weighted graphs. It consists in finding a subset of the graph's nodes such that the aggregate weight of the edges between the subset and its complement is maximized. This book deals with a new separation approach to be used within a branch-and-cut algorithm for solving max-cut problems to optimality. The method is based on graph contraction and allows the fast separation of so-called odd-cycle inequalities. In addition, we describe techniques to add possibly missing edges to an already contracted graph. This allows solving max-cut problems on sparse graphs by means of methods that were originally intended for complete graphs and could not have been applied otherwise. We investigate the theoretical aspects of this combined approach and also explain its realization within a branch-and-cut framework. Finally, we evaluate the performance of our separation procedure on a variety of test instances.

Details

  • Title: Contraction-based Separation and Lifting for Solving the Max-Cut Problem
  • Author: Dr. Thorsten Bonato
  • Edition: 1st edition
  • Published: 1st edition 18.11.2011
  • Department: Mathematics
  • Product Type: Book (Hardcover)
  • Product type: Dissertation
  • Language: English
  • Binding: Softcover (paperback)
  • Dimensions: 21.0 x 14.8 cm (DIN A5)
  • Scope: 197 pages
  • Condition: New (shrink-wrapped in foil)
  • Keywords: artificial extension, branch-and-cut, combinatorial optimization, cut polytope, graph contraction, lifting, max-cut problem, odd-cycle inequality, polyhedral combinatorics, projection, separation, target cuts, unconstrained quadratic 0-1 optimization

Downloads

Download table of contents

Download reading sample

The download of an e-book can be delivered immediately.

DRM: Digital Watermark
This eBook contains a digital watermark and is therefore personalized for you. If the eBook is passed on to third parties abusively, it is possible to trace it back to the source.

File format: PDF (Portable Document Format)
With a fixed page layout, the PDF is particularly suitable for specialist books with columns, tables and figures. A PDF can be displayed on almost all devices, but is only suitable to a limited extent for small displays (smartphone, e-reader).

System requirements:
PC/Mac: You can read this eBook with a PC or Mac. You need a PDF viewer - e.g. Adobe Reader.
eReader: This eBook can be read with (almost) all eBook readers. However, it is not compatible with the Amazon Kindle.
Smartphone/Tablet: Whether Apple or Android, you can read this eBook. You need a PDF viewer - e.g. Adobe Reader.

Buying eBooks from abroad
For tax law reasons we can sell eBooks just within Germany and Switzerland. Regrettably we cannot fulfill eBook orders from other countries.