Padberg Manfred

Manfred Padberg

Information about the author Manfred Padberg will soon be added to the site.
Found 9 papers in total
Mixed integer programming – 1968 and thereafter
Mixed integer programming – 1968 and thereafter
2007
We present some personal reflections on the developments in integer and mixed-integer...
Classical cuts for mixed-integer programming and branch-and-cut
Classical cuts for mixed-integer programming and branch-and-cut
2005
We review classical valid linear inequalities for mixed-integer programming, i.e.,...
Approximating separable nonlinear functions via mixed zero–one programs
Approximating separable nonlinear functions via mixed zero–one programs
2000
We discuss two models from the literature that have been developed to formulate...
Almost perfect matrices and graphs
Almost perfect matrices and graphs
2001
We introduce the notions of ω-projection and κ-projection that map almost...
Order-preserving assignments
Order-preserving assignments
1994
Given an ordered list of n items, p possible positions, and integer profits c ij for...
Solving airline crew scheduling problems by branch-and-cut
Solving airline crew scheduling problems by branch-and-cut
1993
The crew scheduling problem is one that has been studied almost continually for the...
An analytical comparison of different formulations of the travelling salesman problem
An analytical comparison of different formulations of the travelling salesman problem
1991
A transformation technique is proposed that permits one to derive the linear...
Facet identification for the symmetric traveling salesman polytope
Facet identification for the symmetric traveling salesman polytope
1990
Several procedures for the identification of facet inducing inequalities for the...
The Boolean quadratic polytope: Some characteristics, facets and relatives
The Boolean quadratic polytope: Some characteristics, facets and relatives
1989
The paper studies unconstrained quadratic zero-one programming problems having n...
Papers per page: