عنوان

The sharpest cut :

(Number (ISBN

0898715520

(Number (ISBN

9780898715521

Number

b802406

Title Proper

The sharpest cut :

General Material Designation

[Book]

Other Title Information

the impact of Manfred Padberg and his work /

First Statement of Responsibility

edited by Martin Grötschel.

Place of Publication, Distribution, etc.

Philadelphia :

Name of Publisher, Distributor, etc.

MPS,

Date of Publication, Distribution, etc.

©2004.

Specific Material Designation and Extent of Item

xi, 380 pages :

Other Physical Details

illustrations ;

Dimensions

26 cm.

Series Title

MPS-SIAM series on optimization ;

Volume Designation

4

Text of Note

Includes bibliographical references and index.

Text of Note

Manfred Padberg: Curriculum Vitae and Survey of His Work -- Manfred Padberg: Curriculum Vitae -- Time for Old and New Faces / Laurence Wolsey -- Set Packing and Partitioning -- Perfect Matrices -- The Traveling Salesman Problem -- Knapsacks, etc. -- New Faces, or Whither Branch-and-Cut? -- Packing, Stable Sets, and Perfect Graphs -- Combinatorial Packing Problems / Ralf Borndorfer -- Combinatorial Packing -- Dantzig-Wolfe Set Packing Formulations -- Bicolorings and Equitable Bicolorings of Matrices / Michele Conforti, Gerard Cornuejols, Giacomo Zambelli -- The Clique-Rank of 3-Chromatic Perfect Graphs / Jean Fonlupt -- The Forcing Rule Conjecture -- Some Combinatorial Results -- Dependence Relations -- Proof of the Main Theorem -- A New Proof of Tucker's Theorem -- On the Way to Perfection: Primal Operations for Stable Sets in Graphs / Claudio Gentile, Utz-Uwe Haus, Matthias Koppe, Giovanni Rinaldi, Robert Weismantel -- Valid Graph Transformations -- Optimizing Over Stable Sets -- Properties of Alternating-Path Substitutions -- Relaxing Perfectness: Which Graphs Are "Almost" Perfect? / Annegret K. Wagler -- Rank Constraints and Sequential Lifting -- Near-Perfect Graphs -- Rank-Perfect Graphs -- Weakly Rank-Perfect Graphs -- Polyhedral Combinatorics -- Cardinality Homogeneous Set Systems, Cycles in Matroids, and Associated Polytopes / Martin Grotschel -- Matroids -- Cycle Polytopes -- Cardinality Homogeneous Set Systems -- A Primal and a Dual Greedy Algorithm -- Facets -- Separation -- (1,2)-Survivable Networks: Facets and Branch-and-Cut / Herve Kerivin, Ali Ridha Mahjoub, Charles Nocq -- Critical Extreme Points -- Facets of TECSP(G) -- A Branch-and-Cut Algorithm -- Computational Results -- The Domino Inequalities for the Symmetric Traveling Salesman Problem / Denis Naddef -- The Domino Inequalities -- Minimal and Nonpathological Domino Configurations -- The Noncrossing Property and Nesting of Teeth -- The Structure of the Teeth in a Domino Inequality -- Computing Optimal Consecutive Ones Matrices / Marcus Oswald, Gerhard Reinelt -- The Consecutive Ones Polytope -- Separation -- Primal Heuristic -- Computational Results -- Protein Folding on Lattices: An Integer Programming Approach / Vijay Chandru, M. Rammohan Rao, Ganesh Swaminathan -- Formulation -- Additional Inequalities -- Grid Size and Elimination of Variables -- Alternative Formulation -- Row and Column Generation -- Computational Results -- General Polytopes -- On the Expansion of Graphs of 0/1-Polytopes / Volker Kaibel -- Expansion and Eigenvalues -- Small Dimensions -- Flow Methods -- Some Remarks -- Typical and Extremal Linear Programs / Gunter M. Ziegler -- Real LPs -- Long Paths -- Longest Paths -- Short Paths -- Semidefinite Programming -- A Cutting Plane Algorithm for Large Scale Semidefinite Relaxations / Christoph Helmberg -- Semidefinite Programming Relaxations for Quadratic 0/1- and [plus or minus]1-Programming -- Primal Convergence of the Spectral Bundle Method -- Extension to a Cutting Plane Algorithm -- Implementation -- Computational Results -- Semidefinite Relaxations for Max-Cut / Monique Laurent -- Comparing the Lovasz-Schrijver and Lasserre Relaxations for Max-Cut -- Bounds on the Rank of the Lasserre Procedure -- Geometric Properties of the Matrix Sets F[subscript t](n) -- Numerical Comparison of the Various Relaxations for Small n -- Computation -- The Steinberg Wiring Problem / Nathan W. Brixius, Kurt M. Anstreicher -- Quadratic Assignment Problems -- Solution Approaches for the Quadratic Assignment Problem -- Solving the Steinberg Problem -- Mixed-Integer Programming: A Progress Report / Robert E. Bixby, Mary Fenelon, Zonghao Gu, Ed Rothberg, Roland Wunderling -- Linear Programming -- Mixed-Integer Programming -- A Short Computational History of Mixed-Integer Programming -- The New Generation of Codes -- Computational Results -- Graph Drawing: Exact Optimization Helps! / Petra Mutzel, Michael Junger -- Topology: Crossing Minimization -- Shape:e Bend Minimization -- Metrics: Compaction -- Reflections -- Banquet Speech at the Celebration of Manfred Padberg's 60th Birthday by Egon Balas -- Speech of Claude Berge, Read at the Workshop in Honor of Manfred Padberg, Berlin, October 13, 2001 -- Banquet Speech in Honor of Manfred Padberg's 60th Birthday / Harold Kuhn.

0

Title

Sharpest cut.

Combinatorial optimization, Congresses.

Programming (Mathematics), Congresses.

Combinatória (congressos)

Combinatorial optimization.

Kombinatorische Optimierung.

Kombinatorische Optimierung.

Otimização combinatória (congressos)

Programming (Mathematics)

Number

Edition

Class number

Book number

Class number

Class number

System Code

System Code

Grötschel, Martin.

Padberg, M. W.

Date of Transaction

20201207152101.0

Electronic name

[Book]

Y