On the Set-Covering Problem. - Egon Balas; Manfred W. Padberg (Oper. Res., 1972)

On the facial structure of set packing polyhedra. - Manfred W. Padberg (Math. Program., 1973)

Perfect zero-one matrices. - Manfred W. Padberg (Math. Program., 1974)

The travelling salesman problem and a class of polyhedra of diameter two. - Manfred W. Padberg; M. R. Rao (Math. Program., 1974)

On the Set-Covering Problem: II. An Algorithm for Set Partitioning. - Egon Balas; Manfred Padberg (Oper. Res., 1975)

Technical Note - A Note on Zero-One Programming. - Manfred W. Padberg (Oper. Res., 1975)

Partial linear characterizations of the asymmetric travelling salesman polytope. - Martin Grötschel; Manfred W. Padberg (Math. Program., 1975)

A note on the total unimodularity of matrices. - Manfred W. Padberg (Discret. Math., 1976)

Simple Criteria for Optimal Portfolio Selection with Upper Bounds. - Edwin J. Elton; Martin J. Gruber; Manfred W. Padberg (Oper. Res., 1977)

Technical Note - A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges. - Saman Hong; Manfred W. Padberg (Oper. Res., 1977)

Lineare Charakterisierungen von Travelling Salesman Problemen. - Martin Grötschel; Manfred W. Padberg (Math. Methods Oper. Res., 1977)

On the symmetric travelling salesman problem I: Inequalities. - Martin Grötschel; Manfred Padberg (Math. Program., 1979)

On the symmetric travelling salesman problem II: Lifting theorems and facets. - Martin Grötschel; Manfred Padberg (Math. Program., 1979)

(1, k)-configurations and facets for packing problems. - Manfred Padberg (Math. Program., 1980)

A note of the knapsack problem with special ordered sets. - Ellis L. Johnson; Manfred W. Padberg (Oper. Res. Lett., 1981)

Odd Minimum Cut-Sets and b-Matchings. - Manfred W. Padberg; M. R. Rao (Math. Oper. Res., 1982)

Solving Large-Scale Zero-One Linear Programming Problems. - Harlan P. Crowder; Ellis L. Johnson; Manfred W. Padberg (Oper. Res., 1983)

On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets. - D. Chinhyung Cho; Ellis L. Johnson; Manfred Padberg; M. R. Rao (Math. Oper. Res., 1983)

On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems. - D. Chinhyung Cho; Manfred W. Padberg; M. R. Rao (Math. Oper. Res., 1983)

Fractional covers for forests and matchings. - Manfred Padberg; Laurence A. Wolsey (Math. Program., 1984)

Valid Linear Inequalities for Fixed Charge Problems. - Manfred W. Padberg; Tony J. Van Roy; Laurence A. Wolsey (Oper. Res., 1985)

The Complexity of Matching with Bonds. - Manfred Padberg; Antonio Sassano (Inf. Process. Lett., 1989)

The boolean quadric polytope: Some characteristics, facets and relatives. - Manfred Padberg (Math. Program., 1989)

An Efficient Algorithm for the Minimum Capacity Cut Problem. - Manfred Padberg; Giovanni Rinaldi (Math. Program., 1990)

Facet Identification for the Symmetric Traveling Salesman Polytope. - Manfred Padberg; Giovanni Rinaldi (Math. Program., 1990)

Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut. - Karla L. Hoffman; Manfred Padberg (INFORMS J. Comput., 1991)

An analytical comparison of different formulations of the travelling salesman problem. - Manfred Padberg; Ting-Yi Sung (Math. Program., 1991)

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems. - Manfred Padberg; Giovanni Rinaldi (SIAM Rev., 1991)

Lehman's forbidden minor characterization of ideal 0-1 matrices. - Manfred Padberg (Discret. Math., 1993)

An analytic symmetrization of max flow-min cut. - Manfred Padberg; Ting-Yi Sung (Discret. Math., 1997)

Location, Scheduling, Design and Integer Programming. - Manfred W. Padberg; Minendra P. Rijal (J. Oper. Res. Soc., 1998)

Packing small boxes into a big box. - Manfred Padberg (Math. Methods Oper. Res., 2000)

Approximating separable nonlinear functions via mixed zero-one programs. - Manfred Padberg (Oper. Res. Lett., 2000)

Classical cuts for mixed-integer programming and branch-and-cut. - Manfred Padberg (Math. Methods Oper. Res., 2001)

Almost Perfect Matrices and Graphs. - Manfred Padberg (Math. Oper. Res., 2001)

The Finite Sample Breakdown Point of #8467;1-Regression. - Avi Giloni; Manfred Padberg (SIAM J. Optim., 2004)

Mixed-integer programming - 1968 and thereafter. - Manfred Padberg (Ann. Oper. Res., 2007)

Set Covering, Packing and Partitioning Problems. - Karla L. Hoffman; Manfred Padberg (Encyclopedia of Optimization, 2009)

The rank of (mixed-) integer polyhedra. - Manfred Padberg (Math. Program., 2013)