The Sharpest Cut (MPS-SIAM Series on Optimization)

✍ Scribed by Martin Grotschel

Year: 1987
Tongue: English
Leaves: 392
Category: Library

No coin nor oath required. For personal study only.

✦ Synopsis

The Sharpest Cut is written in honor of Manfred Padberg, who has made fundamental contributions to both the theoretical and computational sides of integer programming and combinatorial optimization. This outstanding collection presents recent results in these areas that are closely connected to Padberg's research. His deep commitment to the geometrical approach to combinatorial optimization can be felt throughout this volume; his search for increasingly better and computationally efficient cutting planes gave rise to its title. The peer-reviewed papers contained here are based on invited lectures given at a workshop held in October 2001 to celebrate Padberg's 60th birthday. Grouped by topic (packing, stable sets, and perfect graphs; polyhedral combinatorics; general polytopes; semidefinite programming; computation), many of the papers set out to solve challenges set forth in Padberg’s work. The book also shows how Padberg's ideas on cutting planes have influenced modern commercial optimization software.

📜 SIMILAR VOLUMES

Trust-Region Methods (MPS-SIAM Series on

📁 Trust-Region Methods (MPS-SIAM Series on Optimization)

✍ Andrew R. Conn, Nicholas I. M. Gould, Philippe L. Toint 📂 Library 📅 1987 🌐 English

This is the first comprehensive reference on trust-region methods, a class of numerical algorithms for the solution of nonlinear convex optimization methods. Its unified treatment covers both unconstrained and constrained problems and reviews a large part of the specialized literature on the subject

Introduction to Derivative-Free Optimiza

📁 Introduction to Derivative-Free Optimization (Mps-Siam Series on Optimization)

✍ Andrew R. Conn, Katya Scheinberg, Luís N. Vicente 📂 Library 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English

The absence of derivatives, often combined with the presence of noise or lack of smoothness, is a major challenge for optimization. This book explains how sampling and model techniques are used in derivative-free methods and how these methods are designed to efficiently and rigorously solve optimiza

Applications of Stochastic Programming (

📁 Applications of Stochastic Programming (MPS-SIAM Series on Optimization)

✍ Stein W. Wallace, William T. Ziemba 📂 Library 📅 2005 🌐 English

Research on algorithms and applications of stochastic programming, the study of procedures for decision making under uncertainty over time, has been very active in recent years and deserves to be more widely known. This is the first book devoted to the full scale of applications of stochastic progra

Linear Programming with MATLAB (MPS-SIAM

📁 Linear Programming with MATLAB (MPS-SIAM Series on Optimization)

✍ Michael C. Ferris, Olvi L. Mangasarian, Stephen J. Wright 📂 Library 🌐 English

Lectures on Modern Convex Optimization:

📁 Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications (MPS-SIAM Series on Optimization)

✍ Aharon Ben-Tal, Arkadi Nemirovski 📂 Library 📅 2001 🏛 Society for Industrial Mathematics 🌐 English

Lectures on Convex Optimization is devoted to well structured and efficiently solvable convex optimization problems, with an emphasis on conic quadratic and semidefinite programming. The authors begin with linear programming, and then progress to conic programming. [I really enjoyed their descriptio

Lectures on Modern Convex Optimization:

📁 Lectures on Modern Convex Optimization: Analysis, Algorithms, and Engineering Applications (MPS-SIAM Series on Optimization)

✍ Aharon Ben-Tal, Arkadi Nemirovski 📂 Library 📅 2001 🌐 English

Here is a book devoted to well-structured and thus efficiently solvable convex optimization problems, with emphasis on conic quadratic and semidefinite programming. The authors present the basic theory underlying these problems as well as their numerous applications in engineering, including synthes