Manfred W. Padberg

According to our database1, Manfred W. Padberg authored at least 39 papers between 1972 and 2013.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

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

2009
Set Covering, Packing and Partitioning Problems.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

2007
Mixed-integer programming - 1968 and thereafter.
Ann. Oper. Res., 2007

2005
Classical Cuts for Mixed-Integer Programming and Branch-and-Cut.
Ann. Oper. Res., 2005

2004
The Finite Sample Breakdown Point of #8467;<sub>1</sub>-Regression.
SIAM J. Optim., 2004

2001
Almost Perfect Matrices and Graphs.
Math. Oper. Res., 2001

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

Packing small boxes into a big box.
Math. Methods Oper. Res., 2000

1998
Location, Scheduling, Design and Integer Programming.
J. Oper. Res. Soc., 1998

1997
An analytic symmetrization of max flow-min cut.
Discret. Math., 1997

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

1991
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems.
SIAM Rev., 1991

An analytical comparison of different formulations of the travelling salesman problem.
Math. Program., 1991

Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut.
INFORMS J. Comput., 1991

1990
Facet Identification for the Symmetric Traveling Salesman Polytope.
Math. Program., 1990

An Efficient Algorithm for the Minimum Capacity Cut Problem.
Math. Program., 1990

1989
The boolean quadric polytope: Some characteristics, facets and relatives.
Math. Program., 1989

The Complexity of Matching with Bonds.
Inf. Process. Lett., 1989

1985
Valid Linear Inequalities for Fixed Charge Problems.
Oper. Res., 1985

1984
Fractional covers for forests and matchings.
Math. Program., 1984

1983
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems.
Math. Oper. Res., 1983

On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets.
Math. Oper. Res., 1983

Solving Large-Scale Zero-One Linear Programming Problems.
Oper. Res., 1983

1982
Odd Minimum Cut-Sets and <i>b</i>-Matchings.
Math. Oper. Res., 1982

1981
A note of the knapsack problem with special ordered sets.
Oper. Res. Lett., 1981

1980
(1, <i>k</i>)-configurations and facets for packing problems.
Math. Program., 1980

1979
On the symmetric travelling salesman problem II: Lifting theorems and facets.
Math. Program., 1979

On the symmetric travelling salesman problem I: Inequalities.
Math. Program., 1979

1977
Lineare Charakterisierungen von Travelling Salesman Problemen.
Math. Methods Oper. Res., 1977

Technical Note - A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges.
Oper. Res., 1977

Simple Criteria for Optimal Portfolio Selection with Upper Bounds.
Oper. Res., 1977

1976
A note on the total unimodularity of matrices.
Discret. Math., 1976

1975
Partial linear characterizations of the asymmetric travelling salesman polytope.
Math. Program., 1975

Technical Note - A Note on Zero-One Programming.
Oper. Res., 1975

On the Set-Covering Problem: II. An Algorithm for Set Partitioning.
Oper. Res., 1975

1974
The travelling salesman problem and a class of polyhedra of diameter two.
Math. Program., 1974

Perfect zero-one matrices.
Math. Program., 1974

1973
On the facial structure of set packing polyhedra.
Math. Program., 1973

1972
On the Set-Covering Problem.
Oper. Res., 1972


  Loading...