SCEAS

The SCEAS System

Title:
Author:

Manfred Padberg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Manfred Padberg, Antonio Sassano
The Complexity of Matching with Bonds. [Citation Graph (0, 0)][DBLP]
Inf. Process. Lett., 1989, v:32, n:6, pp:297-300 [Journal]
Manfred Padberg
Almost Perfect Matrices and Graphs. [Citation Graph (0, 0)][DBLP]
Math. Oper. Res., 2001, v:26, n:1, pp:1-18 [Journal]
Manfred Padberg, Giovanni Rinaldi
An Efficient Algorithm for the Minimum Capacity Cut Problem. [Citation Graph (0, 0)][DBLP]
Math. Program., 1990, v:47, n:, pp:19-36 [Journal]
Manfred Padberg, Giovanni Rinaldi
Facet Identification for the Symmetric Traveling Salesman Polytope. [Citation Graph (0, 0)][DBLP]
Math. Program., 1990, v:47, n:, pp:219-257 [Journal]
Manfred Padberg, Ting-Yi Sung
An analytical comparison of different formulations of the travelling salesman problem. [Citation Graph (0, 0)][DBLP]
Math. Program., 1991, v:52, n:, pp:315-357 [Journal]
Manfred Padberg
Approximating separable nonlinear functions via mixed zero-one programs. [Citation Graph (0, 0)][DBLP]
Oper. Res. Lett., 2000, v:27, n:1, pp:1-5 [Journal]
Manfred Padberg, Ting-Yi Sung
An analytic symmetrization of max flow-min cut. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1997, v:165, n:, pp:531-545 [Journal]
Manfred Padberg
Lehman's forbidden minor characterization of ideal 0-1 matrices. [Citation Graph (0, 0)][DBLP]
Discrete Mathematics, 1993, v:111, n:1-3, pp:409-420 [Journal]

Search in 0.001secs, Finished in 0.002secs

NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades

NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP