Paradigms of Combinatorial Optimization
Home > Mathematics and Science Textbooks > Mathematics > Optimization > Paradigms of Combinatorial Optimization: Problems and New Approaches
Paradigms of Combinatorial Optimization: Problems and New Approaches

Paradigms of Combinatorial Optimization: Problems and New Approaches

|
     0     
5
4
3
2
1




Available


About the Book

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management.  The three volumes of the Combinatorial Optimization series aim to cover a wide range  of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization. Concepts of Combinatorial Optimization, is divided into three parts: - On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity; - Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming; - Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

Table of Contents:
Preface xvii Vangelis Th. Paschos Part I Paradigmatic Problems 1 Chapter 1 Optimal Satisfiability 3 Cristina Bazgan Chapter 2 Scheduling Problems 33 Philippe Chrétienne and Christophe Picouleau Chapter 3 Location Problems 61 Aristotelis Giannakos Chapter 4 MiniMax Algorithms and Games 89 Michel Koskas Chapter 5 Two-dimensional Bin Packing Problems 107 Andrea Lodi, Silvano Martello, Michele Monaci and Daniele Vigo Chapter 6 The Maximum Cut Problem 131 Walid Ben-Ameur, Ali Ridha Mahjoub and José Neto Chapter 7 The Traveling Salesman Problem and its Variations 173 Jérôme Monnot and Sophie Toulouse Chapter 8 0-1 Knapsack Problems 215 Gerard Plateau and Anass Nagih Chapter 9 Integer Quadratic Knapsack Problems 243 Dominique Quadri, Eric Soutif and Pierre Tolla Chapter 10 Graph Coloring Problems 265 Dominique De Werra and Daniel Kobler Part II New Approaches 311 Chapter 11 Polynomial Approximation 313 Marc Demange and Vangelis Th. Paschos Chapter 12 Approximation Preserving Reductions 351 Giorgio Ausiello and Vangelis Th. Paschos Chapter 13 Inapproximability of Combinatorial Optimization Problems 381 Luca Trevisan Chapter 14 Local Search: Complexity and Approximation 435 Eric Angel, Petros Christopoulos and Vassilis Zissimopoulos Chapter 15 On-line Algorithms 473 Giorgio Ausiello and Luca Becchetti Chapter 16 Polynomial Approximation for Multicriteria Combinatorial Optimization Problems 511 Eric Angel, Evripidis Bampis and Laurent Gourves Chapter 17 An Introduction to Inverse Combinatorial Problems 547 Marc Demange and Jérôme Monnot Chapter 18 Probabilistic Combinatorial Optimization 587 Cecile Murat and Vangelis Th. Paschos Chapter 19 Robust Shortest Path Problems  615 Virginie Gabrel and Cécile Murat Chapter 20 Algorithmic Games 641 Aristotelis Giannakos and Bangelis Paschos Chapter 21 Combinatorial Optimization with Competing Agents 675 Diodato Ferraioli, Laurent Gourvès, Stefano Moretti, Fanny Pascual and Olivier Spanjaard General Bibliography 707 List of Authors 767 Index 773 Summary of Other Volumes in the Series 781


Best Sellers


Product Details
  • ISBN-13: 9781848216570
  • Publisher: ISTE Ltd and John Wiley & Sons Inc
  • Publisher Imprint: ISTE Ltd and John Wiley & Sons Inc
  • Height: 241 mm
  • No of Pages: 720
  • Returnable: N
  • Sub Title: Problems and New Approaches
  • Width: 165 mm
  • ISBN-10: 1848216572
  • Publisher Date: 29 Jul 2014
  • Binding: Hardback
  • Language: English
  • Returnable: N
  • Spine Width: 51 mm
  • Weight: 1343 gr


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Paradigms of Combinatorial Optimization: Problems and New Approaches
ISTE Ltd and John Wiley & Sons Inc -
Paradigms of Combinatorial Optimization: Problems and New Approaches
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.

Paradigms of Combinatorial Optimization: Problems and New Approaches

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!