Facets of Combinatorial Optimization
Home > Mathematics and Science Textbooks > Mathematics > Optimization > Facets of Combinatorial Optimization: Festschrift for Martin Grötschel
Facets of Combinatorial Optimization: Festschrift for Martin Grötschel

Facets of Combinatorial Optimization: Festschrift for Martin Grötschel

|
     0     
5
4
3
2
1




International Edition


About the Book

Martin Grötschel is one of the most influential mathematicians of our time. He has received numerous honors and holds a number of key positions in the international mathematical community. He celebrated his 65th birthday on September 10, 2013. Martin Grötschel’s doctoral descendant tree 1983–2012, i.e., the first 30 years, features 39 children, 74 grandchildren, 24 great-grandchildren and 2 great-great-grandchildren, a total of 139 doctoral descendants. This book starts with a personal tribute to Martin Grötschel by the editors (Part I), a contribution by his very special “predecessor” Manfred Padberg on “Facets and Rank of Integer Polyhedra” (Part II), and the doctoral descendant tree 1983–2012 (Part III). The core of this book (Part IV) contains 16 contributions, each of which is coauthored by at least one doctoral descendant. The sequence of the articles starts with contributions to the theory of mathematical optimization, including polyhedral combinatorics, extended formulations, mixed-integer convex optimization, super classes of perfect graphs, efficient algorithms for subtree-telecenters, junctions in acyclic graphs and preemptive restricted strip covering, as well as efficient approximation of non-preemptive restricted strip covering. Combinations of new theoretical insights with algorithms and experiments deal with network design problems, combinatorial optimization problems with submodular objective functions and more general mixed-integer nonlinear optimization problems. Applications include VLSI layout design, systems biology, wireless network design, mean-risk optimization and gas network optimization. Computational studies include a semidefinite branch and cut approach for the max k-cut problem, mixed-integer nonlinear optimal control, and mixed-integer linear optimization for scheduling and routing of fly-in safari planes. The two closing articles are devoted to computational advances in generalmixed integer linear optimization, the first by scientists working in industry, the second by scientists working in academia. These articles reflect the “scientific facets” of Martin Grötschel who has set standards in theory, computation and applications.

Table of Contents:
Martin Grötschel - a tribute: M.Jünger and G.Reinelt.- Facets and rank of integer polyhedra: M.Padberg.- Constructing extended formulations from reflection relations: V.Kaibel and K.Pashkovich.- Exact algorithms for combinatorial optimization problems with submodular objective functions: F.Baumann, S.Berckey, and C.Buchheim.- Solving k-way graph partitioning problems to optimality: The impact of semidefinite relaxations and the bundle method: M.F. Anjos, B.Ghaddar, L.Hupp, F.Liers and A.Wiegele.- Mirror-descent methods in mixed-integer convex optimization: M.Baes, T.Oertel, Ch.Wagner and R.Weismantel.- On perspective functions and vanishing constraints in mixed-integer nonlinear optimal control: M.Jung, Ch.Kirches, and S.Sager.- Beyond perfection: computational results for superclasses: A.Pecher and A.Wagler.- Algorithms for junctions in acyclic graphs: C.E. Ferreira and A.J.P. Franco.- A primal heuristic for nonsmooth mixed integer nonlinear optimization: M.Schmidt, M.C. Steinbach, and B.M. Willert.- Flow-Over-Flow Models and an Application to the Scheduling and Routing of Fly-in Safari Planes: A.Fügenschuh, G.Nemhauser, and Y.Zeng.- How Many Steiner Terminals Can You Connect in 20 Years?: R.Borndörfer, N.- D.Hoang, M.Karbstein, Th.Koch, and A.Martin.- Robust heaviest connected subgraphs in networks: E.Alvarez Miranda, I.Ljubic, and P.Mutzel.- Algorithms for scheduling sensors to maximize coverage time: R.da Ponte Barbosa and Y.Wakabayashi.- From vertex-telecenters to subtree-telecenters: Z.Win and C.Kyi Than.- A new algorithm for MINLP applied to gas transport energy cost minimization: B.Geißler, A.Morsi and L.Schewe.- Progress in academic computational integer programming: Th.Koch, A.Martin, and M.E. Pfetsch.- Mixed Integer Programming: Analyzing 12 Years of Progress: T.Achterberg and R.Wunderling​.


Best Sellers


Product Details
  • ISBN-13: 9783642381881
  • Publisher: Springer-Verlag Berlin and Heidelberg GmbH & Co. KG
  • Publisher Imprint: Springer-Verlag Berlin and Heidelberg GmbH & Co. K
  • Height: 235 mm
  • No of Pages: 506
  • Returnable: Y
  • Width: 155 mm
  • ISBN-10: 364238188X
  • Publisher Date: 14 Jul 2013
  • Binding: Hardback
  • Language: English
  • Returnable: Y
  • Sub Title: Festschrift for Martin Grötschel


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Facets of Combinatorial Optimization: Festschrift for Martin Grötschel
Springer-Verlag Berlin and Heidelberg GmbH & Co. KG -
Facets of Combinatorial Optimization: Festschrift for Martin Grötschel
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.

Facets of Combinatorial Optimization: Festschrift for Martin Grötschel

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!