Manfred Padberg - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 23 from 23

2013

The rank of (mixed-) integer polyhedraManfred Padberg. mp, 137(1-2):593-599, 2013. [doi]

2007

Mixed-integer programming - 1968 and thereafterManfred Padberg. anor, 149(1):163-175, 2007. [doi]

2005

Classical Cuts for Mixed-Integer Programming and Branch-and-CutManfred Padberg. anor, 139(1):321-352, 2005. [doi]

2004

The Finite Sample Breakdown Point of /boldmath /ell_1 -RegressionAvi Giloni, Manfred Padberg. siamjo, 14(4):1028-1042, 2004. [doi]

2001

Almost Perfect Matrices and GraphsManfred Padberg. mor, 26(1):1-18, 2001. [doi]

Classical cuts for mixed-integer programming and branch-and-cutManfred Padberg. mmor, 53(2):173-203, 2001. [doi]

2000

Approximating separable nonlinear functions via mixed zero-one programsManfred Padberg. orl, 27(1):1-5, 2000. [doi]

Packing small boxes into a big boxManfred Padberg. mmor, 52(1):1-21, 2000. [doi]

1997

An analytic symmetrization of max flow-min cutManfred Padberg, Ting-Yi Sung. DM, 165-166:531-545, 1997. [doi]

1993

Lehman s forbidden minor characterization of ideal 0-1 matricesManfred Padberg. DM, 111(1-3):409-420, 1993. [doi]

1991

Improving LP-Representations of Zero-One Linear Programs for Branch-and-CutKarla L. Hoffman, Manfred Padberg. informs, 3(2):121-134, 1991. [doi]

An analytical comparison of different formulations of the travelling salesman problemManfred Padberg, Ting-Yi Sung. mp, 52:315-357, 1991.

A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman ProblemsManfred Padberg, Giovanni Rinaldi. siamrev, 33(1):60-100, 1991. [doi]

1990

An Efficient Algorithm for the Minimum Capacity Cut ProblemManfred Padberg, Giovanni Rinaldi. mp, 47:19-36, 1990.

Facet Identification for the Symmetric Traveling Salesman PolytopeManfred Padberg, Giovanni Rinaldi. mp, 47:219-257, 1990.

1989

The boolean quadric polytope: Some characteristics, facets and relativesManfred Padberg. mp, 45(1-3):139-172, 1989. [doi]

The Complexity of Matching with BondsManfred Padberg, Antonio Sassano. ipl, 32(6):297-300, 1989.

1984

Fractional covers for forests and matchingsManfred Padberg, Laurence A. Wolsey. mp, 29(1):1-14, 1984. [doi]

1983

On the Uncapacitated Plant Location Problem. I: Valid Inequalities and FacetsD. Chinhyung Cho, Ellis L. Johnson, Manfred Padberg, M. R. Rao. mor, 8(4):579-589, 1983. [doi]

1980

k)-configurations and facets for packing problemsManfred Padberg. mp, 18(1):94-99, 1980. [doi]

1979

On the symmetric travelling salesman problem I: InequalitiesMartin Grötschel, Manfred Padberg. mp, 16(1):265-280, 1979. [doi]

On the symmetric travelling salesman problem II: Lifting theorems and facetsMartin Grötschel, Manfred Padberg. mp, 16(1):281-302, 1979. [doi]

1975

On the Set-Covering Problem: II. An Algorithm for Set PartitioningEgon Balas, Manfred Padberg. ior, 23(1):74-90, 1975. [doi]

Sign in or sign up to see more results.

runs on WebDSL