The following pages link to Manfred W. Padberg (Q189591):
Displaying 50 items.
- (Q537606) (redirect page) (← links)
- Mixed-integer programming -- 1968 and thereafter (Q537607) (← links)
- Lehman's forbidden minor characterization of ideal 0-1 matrices (Q686505) (← links)
- Facet identification for the symmetric traveling salesman polytope (Q918865) (← links)
- A different convergence proof of the projective method for linear programming (Q1088902) (← links)
- Total unimodularity and the Euler-subgraph problem (Q1107442) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- The complexity of matching with bonds (Q1123620) (← links)
- A note on the knapsack problem with special ordered sets (Q1168894) (← links)
- An analytical comparison of different formulations of the travelling salesman problem (Q1181739) (← links)
- A note on the total unimodularity of matrices (Q1236586) (← links)
- Almost integral polyhedra related to certain combinatorial optimization problems (Q1240148) (← links)
- Linear optimization and extensions. (Q1296340) (← links)
- Boolean polynomials and set functions (Q1310196) (← links)
- Location, scheduling, design and integer programming (Q1352556) (← links)
- An analytic symmetrization of max flow-min cut (Q1356775) (← links)
- Packing small boxes into a big box. (Q1403159) (← links)
- Approximating separable nonlinear functions via mixed zero-one programs (Q1591598) (← links)
- Optimal project selection when borrowing and lending rates differ (Q1596890) (← links)
- Alternative methods of linear regression (Q1609471) (← links)
- (Q1876765) (redirect page) (← links)
- Least trimmed squares regression, least median squares regression, and mathematical program\-ming (Q1876766) (← links)
- Linear optimization and extensions (Q1892405) (← links)
- The rank of (mixed-) integer polyhedra (Q1942280) (← links)
- Almost Perfect Matrices and Graphs (Q2757664) (← links)
- (Q3048579) (← links)
- On the symmetric travelling salesman problem I: Inequalities (Q3048580) (← links)
- On the symmetric travelling salesman problem II: Lifting theorems and facets (Q3048581) (← links)
- (Q3206661) (← links)
- Fractional covers for forests and matchings (Q3315281) (← links)
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems (Q3362088) (← links)
- Degree-two Inequalities, Clique Facets, and Biperfect Graphs (Q3673580) (← links)
- Trees and Cuts (Q3674420) (← links)
- (Q3677793) (← links)
- (Q3686494) (← links)
- Solving Large-Scale Zero-One Linear Programming Problems (Q3696859) (← links)
- Valid Linear Inequalities for Fixed Charge Problems (Q3703656) (← links)
- (Q3714900) (← links)
- (Q3714901) (← links)
- Branch-and-cut approach to a variant of the traveling salesman problem (Q3812063) (← links)
- (Q3865830) (← links)
- (1,k)-configurations and facets for packing problems (Q3869083) (← links)
- On the symmetric travelling salesman problem: A computational study (Q3875701) (← links)
- Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality (Q3888840) (← links)
- Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut (Q4025902) (← links)
- Constraint Pairing In Integer Programming (Q4058478) (← links)
- (Q4068474) (← links)
- Technical Note—A Note on Zero-One Programming (Q4071008) (← links)
- (Q4074669) (← links)
