Manfred W. Padberg

Manfred W. Padberg's AcademicInfluence.com Rankings

Manfred W. Padberg

Mathematics

#1682

World Rank

#2702

Historical Rank

Measure Theory

#1694

World Rank

#2082

Historical Rank

mathematics Degrees

Download Badge

Mathematics

Manfred W. Padberg's Degrees

PhD Mathematics University of Bonn

Why Is Manfred W. Padberg Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Manfred Wilhelm Padberg was a German mathematician who worked with linear and combinatorial optimization. He and Ellis L. Johnson won the John von Neumann Theory Prize in 2000. Biography Padberg grew up in Zagreb, Croatia, and Westphalia. From 1961 he studied mathematics at the University of Münster, where he graduated in 1967. In 1967, he was a research assistant at the University of Mannheim. Starting in September 1968, he studied at Carnegie Mellon University, where he obtained a master's degree and his Ph.D. in Industrial Administration. His advisor was Egon Balas and his dissertation was titled Essays in Integer Programming.

(See a Problem?)

Manfred W. Padberg's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems (1991) (1088)
Solving Large-Scale Zero-One Linear Programming Problems (1983) (698)
On the facial structure of set packing polyhedra (1973) (646)
Solving airline crew scheduling problems by branch-and-cut (1993) (585)
Set Partitioning: A survey (1976) (467)
Odd Minimum Cut-Sets and b-Matchings (1982) (427)
The boolean quadric polytope: Some characteristics, facets and relatives (1989) (386)
Addendum: Optimization of a 532-city symmetric traveling salesman problem by branch and cut (1990) (367)
Simple Criteria for Optimal Portfolio Selection (1976) (311)
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality (1980) (300)
Linear Optimization and Extensions (1995) (279)
Valid Linear Inequalities for Fixed Charge Problems (1985) (262)
Perfect zero–one matrices (1974) (239)
On the symmetric travelling salesman problem I: Inequalities (1979) (229)
On the Set-Covering Problem (1972) (205)
On the symmetric travelling salesman problem: A computational study (1980) (168)
Approximating Separable Nonlinear Functions Via Mixed Zero-One Programs (1998) (166)
On the symmetric travelling salesman problem II: Lifting theorems and facets (1979) (159)
Facet identification for the symmetric traveling salesman polytope (1990) (158)
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (1991) (155)
An efficient algorithm for the minimum capacity cut problem (1990) (132)
Lp-based combinatorial problem solving (1985) (119)
Covering, Packing and Knapsack Problems (1979) (112)
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets (1983) (106)
An analytical comparison of different formulations of the travelling salesman problem (1991) (100)
Technical Note - A Note on Zero-One Programming (1975) (88)
The travelling salesman problem and a class of polyhedra of diameter two (1974) (88)
On the Set-Covering Problem: II. An Algorithm for Set Partitioning (1972) (85)
Location, Scheduling, Design and Integer Programming (2011) (85)
(1,k)-configurations and facets for packing problems (1980) (85)
Packing small boxes into a big box (2000) (84)
A note of the knapsack problem with special ordered sets (1981) (72)
Trees and Cuts (1983) (70)
SIMPLE CRITERIA FOR OPTIMAL PORTFOLIO SELECTION: TRACING OUT THE EFFICIENT FRONTIER (1978) (66)
Degree-two Inequalities, Clique Facets, and Biperfect Graphs (1982) (64)
Simple Rules for Optimal Portfolio Selection: The Multi Group Case (1977) (63)
On the symmetric travelling salesman problem II (1979) (60)
Technical Note - A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges (1977) (49)
On the Complexity of Set Packing Polyhedra (1977) (46)
Linear Optimization and Extensions: Problems and Solutions (2001) (46)
Almost integral polyhedra related to certain combinatorial optimization problems (1976) (43)
Lehman's forbidden minor characterization of ideal 0-1 matrices (1993) (41)
Least trimmed squares regression, least median squares regression, and mathematical programming (2002) (38)
Alternative Methods of Linear Regression (2001) (37)
Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach (1972) (36)
Optimal Portfolios from Simple Ranking Devices (1978) (35)
Autoregressive Approaches to Disaggregation of Time Series Data (1971) (35)
Optimal project selection when borrowing and lending rates differ (1999) (31)
Simple Criteria for Optimal Portfolio Selection with Upper Bounds (1977) (28)
A different convergence proof of the projective method for linear programming (1986) (28)
Classical Cuts for Mixed-Integer Programming and Branch-and-Cut (2005) (28)
A Note on Zero-One Programming (2016) (28)
A branch-and-cut approach to a traveling salesman problem with side constraints (1989) (25)
Constraint Pairing In Integer Programming (1975) (21)
Characterisations of Totally Unimodular, Balanced and Perfect Matrices (1975) (21)
Set Covering, Packing and Partitioning Problems (2009) (20)
Partial linear characterizations of the asymmetric travelling salesman polytope (1975) (20)
Total unimodularity and the Euler-subgraph problem (1988) (18)
Essays in integer programming (1971) (15)
A note on the total unimodularity of matrices (1976) (14)
The Finite Sample Breakdown Point of #8467;1-Regression (2004) (14)
A Remark on “an Inequality for the Number of Lattice Points in a Simplex” (1971) (12)
Ulysses 2000: In Search of Optimal Solutions to Hard Combinatorial Problems. (1994) (10)
Classical cuts for mixed-integer programming and branch-and-cut (2001) (10)
A polynomial-time solution to Papadimitriou and Steiglitz's 'traps' (1988) (9)
Perfect Zero-One Matrices — II (1974) (8)
Branch-and-cut approach to a variant of the traveling salesman problem (1988) (7)
The Sharpest Cut (MPS-Siam Series on Optimization) (2004) (7)
Order-preserving assignments (1994) (7)
On the Symmetric Travelling Salesman Problem: Theory and Computation (1978) (5)
The rank of (mixed-) integer polyhedra (2013) (5)
Adjacent vertices of the all 0-1 programming polytope (1979) (4)
Facets and Rank of Integer Polyhedra (2013) (4)
Almost Perfect Matrices and Graphs (1998) (4)
Boolean polynomials and set functions (1993) (3)
The Complexity of Matching with Bonds (1989) (3)
The triangular E-model of chance-constrained programming with stochastic A-matrix (1974) (2)
Mixed-integer programming—1968 and thereafter (2007) (2)
Adjacent Vertices of the Convex Hull of Feasible 0-1 Points. (1973) (2)
Application of Graph Transformation Techniques to the Area of Petri Nets (2002) (2)
A Characterization of Perfect Matrices (1984) (1)
An analytic symmetrization of max flow-min cut (1997) (1)
The Optimized Odyssey (2001) (1)
Quadratic Assignment Polytopes (1996) (1)
Combinatorial Optimization: An Introduction (1999) (1)
ON THE S YMMETRIC T RAVELLING S ALESMAN P ROBLEM I: INEQUALITIES (1979) (0)
Report of the Session on: Group theoretic and lagrangean methods (1979) (0)
Scheduling and Design Problems (1996) (0)
Solving Small QAPs (1996) (0)
The Modular Design Problem: Convexity of the Constraint Set. (1971) (0)
Primal-Dual Pairs (1999) (0)
Locally Ideal LP Formulations II (1996) (0)
Quadratic Scheduling Problems (1996) (0)
AIAA/SOLVER - A branch-and-cut approach to the AI variant of the traveling salesman problem (1987) (0)
The triangular e-model of chance-constrained programming with random a-matrix (1974) (0)
The Linear Programming Problem (1999) (0)
The rank of (mixed-) integer polyhedra (2011) (0)

This paper list is powered by the following services:

Other Resources About Manfred W. Padberg

en.wikipedia.org

What Schools Are Affiliated With Manfred W. Padberg?

Manfred W. Padberg is affiliated with the following schools:

Manfred W. Padberg's Academic­Influence.com Rankings