The following pages link to Manfred W. Padberg (Q189591):
Displayed 24 items.
- (Q4077730) (← links)
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning (Q4088572) (← links)
- The Triangular E-Model of Chance-Constrained Programming with Stochastic A-Matrix (Q4088588) (← links)
- Set Partitioning: A survey (Q4117604) (← links)
- Partial linear characterizations of the asymmetric travelling salesman polytope (Q4119036) (← links)
- Lineare Charakterisierungen von Travelling Salesman Problemen (Q4119037) (← links)
- (Q4168779) (← links)
- Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges (Q4170533) (← links)
- Adjacent vertices of the all 0-1 programming polytope (Q4177324) (← links)
- (Q4182528) (← links)
- Covering, Packing and Knapsack Problems (Q4194731) (← links)
- Solving Airline Crew Scheduling Problems by Branch-and-Cut (Q4274629) (← links)
- (Q4287995) (← links)
- (Q4353151) (← links)
- The Finite Sample Breakdown Point of \boldmath$\ell_1$-Regression (Q4651981) (← links)
- Perfect zero–one matrices (Q4770779) (← links)
- On the facial structure of set packing polyhedra (Q5181532) (← links)
- Facets and Rank of Integer Polyhedra (Q5265164) (← links)
- A Remark on “an Inequality for the Number of Lattice Points in a Simplex” (Q5645212) (← links)
- Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach (Q5665017) (← links)
- On the Set-Covering Problem (Q5668245) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5906949) (← links)
- Linear optimization and extensions. Problems and solutions (Q5937524) (← links)