… [201 MW Padberg, "On the facial structure of set covering problems"; IIM Preprint No. 1/7213,
International Institute of Management, Berlin (1972), (presented at the 41 st National …

… (For a discussion of their interrelationships see Padberg (1974b,c).) Asmentioned in 1.4,
the … and perfect matrices, from an algebraic point of view, is to be found in Padberg (1975a). …

We show that the determination of a minimum cut-set of odd cardinality in a graph with even
and odd vertices can be dealt with by a minor modification of the polynomially bounded …

There have been two approaches in the literature to solving the first of these problems. One
has been to use a single index model to generate variancecovariance structures. The …

We report the solution to optimality of ten large-scale symmetric travelling salesman problems.
The travelling salesman problem (TSP) is one of the standard problems of the Operations …

… reported in Padberg and Wolsey. It is also possible to extend the facets generated in this
paper by lifting (Padberg [I979], Wolsey, and Zemel) to obtain facets for problems such as …

We investigate several classes of inequalities for the symmetric travelling salesman problem
with respect to their facet-defining properties for the associated polytope. A new class of …

… Balas and MW Padberg, "On the set covering problem II: An algorithm", Management … [15 ]
MW Padberg, "On the facial structure of set packing polyhedra", Mathematical Programming 5 (…

… The results given here were independently and simultaneously obtained by Professor
Padberg and GL Nemhauser and LE Trotter, J r.l1“l The presentation in reference 13 is …

This paper establishes some useful properties of the equality-constrained set-covering
problem P and the associated linear program P′. First, the Dantzig property of transportation …