default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDManfred W. Padberg
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2013
[j39]Manfred Padberg:
The rank of (mixed-) integer polyhedra. Math. Program. 137(1-2): 593-599 (2013)- 2007
- [j38]Manfred Padberg:
Mixed-integer programming - 1968 and thereafter. Ann. Oper. Res. 149(1): 163-175 (2007) - 2005
- [j37]Manfred Padberg:
Classical Cuts for Mixed-Integer Programming and Branch-and-Cut. Ann. Oper. Res. 139(1): 321-352 (2005) - 2004
- [j36]Avi Giloni, Manfred Padberg:
The Finite Sample Breakdown Point of #8467;1-Regression. SIAM J. Optim. 14(4): 1028-1042 (2004) - 2001
- [j35]Manfred Padberg:
Classical cuts for mixed-integer programming and branch-and-cut. Math. Methods Oper. Res. 53(2): 173-203 (2001) - [j34]Manfred Padberg:
Almost Perfect Matrices and Graphs. Math. Oper. Res. 26(1): 1-18 (2001) - 2000
- [j33]Manfred Padberg:
Packing small boxes into a big box. Math. Methods Oper. Res. 52(1): 1-21 (2000) - [j32]Manfred Padberg:
Approximating separable nonlinear functions via mixed zero-one programs. Oper. Res. Lett. 27(1): 1-5 (2000) - 1998
- [j31]Manfred W. Padberg, Minendra P. Rijal:
Location, Scheduling, Design and Integer Programming. J. Oper. Res. Soc. 49(1): 93-98 (1998) - 1997
- [j30]Manfred Padberg, Ting-Yi Sung:
An analytic symmetrization of max flow-min cut. Discret. Math. 165-166: 531-545 (1997) - 1993
- [j29]Manfred Padberg:
Lehman's forbidden minor characterization of ideal 0-1 matrices. Discret. Math. 111(1-3): 409-420 (1993) - 1991
- [j28]Karla L. Hoffman, Manfred Padberg:
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut. INFORMS J. Comput. 3(2): 121-134 (1991) - [j27]Manfred Padberg, Ting-Yi Sung:
An analytical comparison of different formulations of the travelling salesman problem. Math. Program. 52: 315-357 (1991) - [j26]Manfred Padberg, Giovanni Rinaldi
:
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems. SIAM Rev. 33(1): 60-100 (1991) - 1990
- [j25]Manfred Padberg, Giovanni Rinaldi:
An Efficient Algorithm for the Minimum Capacity Cut Problem. Math. Program. 47: 19-36 (1990) - [j24]Manfred Padberg, Giovanni Rinaldi:
Facet Identification for the Symmetric Traveling Salesman Polytope. Math. Program. 47: 219-257 (1990) - 1989
- [j23]Manfred Padberg, Antonio Sassano:
The Complexity of Matching with Bonds. Inf. Process. Lett. 32(6): 297-300 (1989) - [j22]Manfred Padberg:
The boolean quadric polytope: Some characteristics, facets and relatives. Math. Program. 45(1-3): 139-172 (1989) - 1985
- [j21]Manfred W. Padberg, Tony J. Van Roy, Laurence A. Wolsey:
Valid Linear Inequalities for Fixed Charge Problems. Oper. Res. 33(4): 842-861 (1985) - 1984
- [j20]Manfred Padberg, Laurence A. Wolsey:
Fractional covers for forests and matchings. Math. Program. 29(1): 1-14 (1984) - 1983
- [j19]Harlan P. Crowder, Ellis L. Johnson, Manfred W. Padberg:
Solving Large-Scale Zero-One Linear Programming Problems. Oper. Res. 31(5): 803-834 (1983) - [j18]D. Chinhyung Cho, Ellis L. Johnson, Manfred Padberg, M. R. Rao:
On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets. Math. Oper. Res. 8(4): 579-589 (1983) - [j17]D. Chinhyung Cho, Manfred W. Padberg, M. R. Rao:
On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems. Math. Oper. Res. 8(4): 590-612 (1983) - 1982
- [j16]Manfred W. Padberg, M. R. Rao:
Odd Minimum Cut-Sets and b-Matchings. Math. Oper. Res. 7(1): 67-80 (1982) - 1981
- [j15]Ellis L. Johnson, Manfred W. Padberg:
A note of the knapsack problem with special ordered sets. Oper. Res. Lett. 1(1): 18-22 (1981) - 1980
- [j14]Manfred Padberg:
(1, k)-configurations and facets for packing problems. Math. Program. 18(1): 94-99 (1980) - 1979
- [j13]Martin Grötschel, Manfred Padberg:
On the symmetric travelling salesman problem I: Inequalities. Math. Program. 16(1): 265-280 (1979) - [j12]Martin Grötschel, Manfred Padberg:
On the symmetric travelling salesman problem II: Lifting theorems and facets. Math. Program. 16(1): 281-302 (1979) - 1977
- [j11]Saman Hong, Manfred W. Padberg:
Technical Note - A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges. Oper. Res. 25(5): 871-874 (1977) - [j10]Edwin J. Elton, Martin J. Gruber, Manfred W. Padberg:
Simple Criteria for Optimal Portfolio Selection with Upper Bounds. Oper. Res. 25(6): 952-967 (1977) - [j9]Martin Grötschel, Manfred W. Padberg:
Lineare Charakterisierungen von Travelling Salesman Problemen. Math. Methods Oper. Res. 21(1): 33-64 (1977) - 1976
- [j8]Manfred W. Padberg:
A note on the total unimodularity of matrices. Discret. Math. 14(3): 273-278 (1976) - 1975
- [j7]Egon Balas, Manfred Padberg:
On the Set-Covering Problem: II. An Algorithm for Set Partitioning. Oper. Res. 23(1): 74-90 (1975) - [j6]Manfred W. Padberg:
Technical Note - A Note on Zero-One Programming. Oper. Res. 23(4): 833-837 (1975) - [j5]Martin Grötschel, Manfred W. Padberg:
Partial linear characterizations of the asymmetric travelling salesman polytope. Math. Program. 8(1): 378-381 (1975) - 1974
- [j4]Manfred W. Padberg:
Perfect zero-one matrices. Math. Program. 6(1): 180-196 (1974) - [j3]Manfred W. Padberg, M. R. Rao:
The travelling salesman problem and a class of polyhedra of diameter two. Math. Program. 7(1): 32-45 (1974) - 1973
- [j2]Manfred W. Padberg:
On the facial structure of set packing polyhedra. Math. Program. 5(1): 199-215 (1973) - 1972
- [j1]Egon Balas, Manfred W. Padberg:
On the Set-Covering Problem. Oper. Res. 20(6): 1152-1161 (1972)
Reference Works
- 2009
- [r1]Karla L. Hoffman, Manfred Padberg:
Set Covering, Packing and Partitioning Problems. Encyclopedia of Optimization 2009: 3482-3486
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:09 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
