Home > Mathematics and Science Textbooks > Mathematics > Optimization > Progress in Combinatorial Optimization: Recent Progress
54%
Progress in Combinatorial Optimization: Recent Progress

Progress in Combinatorial Optimization: Recent Progress

          
5
4
3
2
1

Available


Premium quality
Premium quality
Bookswagon upholds the quality by delivering untarnished books. Quality, services and satisfaction are everything for us!
Easy Return
Easy return
Not satisfied with this product! Keep it in original condition and packaging to avail easy return policy.
Certified product
Certified product
First impression is the last impression! Address the book’s certification page, ISBN, publisher’s name, copyright page and print quality.
Secure Checkout
Secure checkout
Security at its finest! Login, browse, purchase and pay, every step is safe and secured.
Money back guarantee
Money-back guarantee:
It’s all about customers! For any kind of bad experience with the product, get your actual amount back after returning the product.
On time delivery
On-time delivery
At your doorstep on time! Get this book delivered without any delay.
Quantity:
Add to Wishlist

About the Book

This book presents recent developments and new trends in Combinatorial Optimization. Combinatorial Optimization is an active research area that has applications in many domains such as communications, network design, VLSI, scheduling, production, computational biology. In the past years, new results and major advances have been seen in many areas including computational complexity, approximation algorithms, cutting-plane based methods and submodularity function minimization. More efficient and powerful methods have been developed for approaching real-worlds problems, and new concepts and theoritical results have been introduced.

Table of Contents:
Partition inequalities : separation, extensions, and network design / Mourad Baïou, Francisco Barahona, A. Ridha Mahjoub Stable sets in claw-free graphs : a journey through algorithms and polytopes / Yuri Faenza, Gianpaolo Oriolo, Gautier Stauffer [and others] Algorithms for submodular totally dual integral problems / S. Thomas McCormick Finding descriptions of polytopes via extended formulations and liftings / Volker Kaibel, Andreas Loos Relax-and-cut as a preprocessor and warm starter to branch-and-cut / Abilio Lucena, Nelson Maculan, Alexandre Salles Da Cunha Weighted transversals and blockers for some optimization problems in graphs / Cedric Bentz, Marie-Christine Costa, Dominique De Werra [and others] On a time-dependent formulation and an updated classification of ATSP formulations / Maria Teresa Godinho, Luis Gouveia, Pierre Pesneau [and others] Cuts over extended formualtions by flow discretization / Eduardo Uchoa Model equivalents and cutting-plane decomposition methods for dominance-constrained two-stage stochastic programs / Dimitri Drapkin, Oliver Klaar, Rüdiger Schultz Combinatorial optimization problems arising from interactive congestion situations / Laurent Gourvès, Stefano Moretti Combinatorial optimization methods to determine the rank of a matrix over a communicative ring, with engineering applications / András Recski Robust routing in communication networks / Walid Ben-Ameur, Adam Ouorou, Mateusz Żotkiewicz Single machine scheduling with a common due date : total weighted tardiness problems / Imed Kacem, Hans Kellerer, Vitaly Strusevich Convergent tabu search for optimal partitioning / Fred Glover, Saïd Hanafi An introduction to exponential time exact algorithms for solving NP-hard problems / Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos Moderately exponential approximation / Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos [and others] Progress in semidefinite optimization techniques for satisfiability / Miguel F. Anjos Disjunctive cuts for mixed integer nonlinear programming problems / Pierre Bonami, Jeff Linderoth, Andrea Lodi Using extended MIP formulations for a production/sequencing and a production/distribution problem / Laurence A. Wosley The two-phase method for multiobjective combinatorial optimization problems / Anthony Przybylski, Xavier Gandibleux, Matthias Ehrgott


Best Sellers


Product Details
  • ISBN-13: 9781848212060
  • Publisher: ISTE Ltd and John Wiley & Sons Inc
  • Publisher Imprint: ISTE Ltd and John Wiley & Sons Inc
  • Depth: 38
  • Language: English
  • Returnable: N
  • Spine Width: 41 mm
  • Weight: 1048 gr
  • ISBN-10: 1848212062
  • Publisher Date: 25 Nov 2011
  • Binding: Hardback
  • Height: 242 mm
  • No of Pages: 603
  • Series Title: English
  • Sub Title: Recent Progress
  • Width: 165 mm


Similar Products

How would you rate your experience shopping for books on Bookswagon?

Add Photo
Add Photo

Customer Reviews

REVIEWS           
Click Here To Be The First to Review this Product
Progress in Combinatorial Optimization: Recent Progress
ISTE Ltd and John Wiley & Sons Inc -
Progress in Combinatorial Optimization: Recent Progress
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.

Progress in Combinatorial Optimization: Recent Progress

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!
    ASK VIDYA