Buy Relaxations and Solutions for the Minimum Graph Bisection Problem
Home > Science & Mathematics > Mathematics > Philosophy of mathematics > Relaxations and Solutions for the Minimum Graph Bisection Problem
Relaxations and Solutions for the Minimum Graph Bisection Problem

Relaxations and Solutions for the Minimum Graph Bisection Problem


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
About the Book

The minimum graph bisection problem is a special kind of a graph partitioning problem, where the nodes of a weighted graph are divided into two subsets with prescribed capacity, and the weighted sum of edges joining nodes in different subsets is minimized. Due to the knapsack condition on the weight of the node subsets the problem is NP-hard. It has a variety of applications, for instance in the design of electronic circuits and devices. In this thesis we investigate current efficient optimization methods to solve to optimality the minimum graph bisection problem. This combinatorial optimization problem can be modeled by means of linear as well as quadratic integer programming. Each formulation leads to a different kind of approximation, in form of a relaxation, and thus different computational methods applied for their solution. Nevertheless, the feasible sets in each representation are in one-to-one correspondence under an affine transformation. Thus the convex hull of the feasible points, the so called bisection cut polytope, is a common object to study. The tightest possible description of this polytope can be utilized to improve the approximations. We incorporate the separation algorithms for the obtained new classes of valid inequalities in a branch-and-cut framework and investigate their interaction with linear and semidefinite relaxations using instances coming from VLSI design and scientific computations as well as random graphs. Generally only the linear relaxation benefits from the new inequalities. Although they also improve the bounds delivered by semidefinite relaxation, the separation time significantly slows down the solution process. The semidefinite relaxation seems to outperform the linear one due to a weakness of the primal methods applied to the linear relaxation. By means of random instances we show that combinations of the linear and the semidefinite relaxation within one solution process pay off.


Best Sellers



Product Details
  • ISBN-13: 9783832517359
  • Publisher: Logos Verlag Berlin
  • Binding: Paperback
  • Language: English
  • Returnable: N
  • Spine Width: 0 mm
  • Width: 145 mm
  • ISBN-10: 3832517359
  • Publisher Date: 30 Nov 2007
  • Height: 210 mm
  • No of Pages: 241
  • Series Title: English
  • Weight: 750 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Relaxations and Solutions for the Minimum Graph Bisection Problem
Logos Verlag Berlin -
Relaxations and Solutions for the Minimum Graph Bisection Problem
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Relaxations and Solutions for the Minimum Graph Bisection Problem

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    New Arrivals



    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!