| Year |
Citation |
Score |
| 2007 |
Padberg M. Mixed-integer programming - 1968 and thereafter Annals of Operations Research. 149: 163-175. DOI: 10.1007/S10479-006-0106-8 |
0.368 |
|
| 2004 |
Giloni A, Padberg M. The finite sample breakdown point of ℓ 1-regression Siam Journal On Optimization. 14: 1028-1042. DOI: 10.1137/S1052623403424156 |
0.645 |
|
| 2002 |
Giloni A, Padberg M. Least trimmed squares regression, least median squares regression, and mathematical programming Mathematical and Computer Modelling. 35: 1043-1060. DOI: 10.1016/S0895-7177(02)00069-9 |
0.674 |
|
| 2002 |
Giloni A, Padberg M. Alternative methods of linear regression Mathematical and Computer Modelling. 35: 361-374. DOI: 10.1016/S0895-7177(01)00170-4 |
0.64 |
|
| 2001 |
Padberg M. Classical cuts for mixed-integer programming and branch-and-cut Mathematical Methods of Operations Research. 53: 173-203. DOI: 10.1007/S001860100120 |
0.399 |
|
| 2000 |
Padberg M. Approximating separable nonlinear functions via mixed zero-one programs Operations Research Letters. 27: 1-5. DOI: 10.1016/S0167-6377(00)00028-6 |
0.481 |
|
| 2000 |
Padberg M. Packing small boxes into a big box Mathematical Methods of Operations Research. 52: 1-21. DOI: 10.1007/S001860000066 |
0.539 |
|
| 1999 |
Padberg M, Wilczak MJ. Optimal project selection when borrowing and lending rates differ Mathematical and Computer Modelling. 29: 63-78. DOI: 10.1016/S0895-7177(99)00030-8 |
0.353 |
|
| 1997 |
Padberg M, Sung TY. An analytic symmetrization of max flow-min cut Discrete Mathematics. 165: 531-545. DOI: 10.1016/S0012-365X(96)00199-9 |
0.354 |
|
| 1993 |
Hoffman KL, Padberg M. Solving airline crew scheduling problems by branch-and-cut Management Science. 39: 657-682. DOI: 10.1287/Mnsc.39.6.657 |
0.493 |
|
| 1993 |
Padberg M, Wilczak MJ. Boolean polynomials and set functions Mathematical and Computer Modelling. 17: 3-6. DOI: 10.1016/0895-7177(93)90012-N |
0.512 |
|
| 1991 |
Hoffman KL, Padberg M. Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut Informs Journal On Computing. 3: 121-134. DOI: 10.1287/Ijoc.3.2.121 |
0.541 |
|
| 1991 |
Padberg M, Rinaldi G. A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems Siam Review. 33: 60-100. DOI: 10.1137/1033004 |
0.427 |
|
| 1991 |
Padberg M, Sung TY. An analytical comparison of different formulations of the travelling salesman problem Mathematical Programming. 52: 315-357. DOI: 10.1007/Bf01582894 |
0.476 |
|
| 1990 |
Padberg M, Rinaldi G. Facet identification for the symmetric traveling salesman polytope Mathematical Programming. 47: 219-257. DOI: 10.1007/Bf01580861 |
0.42 |
|
| 1990 |
Padberg M, Rinaldi G. An efficient algorithm for the minimum capacity cut problem Mathematical Programming. 47: 19-36. DOI: 10.1007/Bf01580850 |
0.393 |
|
| 1989 |
Padberg M, Sassano A. The complexity of matching with bonds Information Processing Letters. 32: 297-300. DOI: 10.1016/0020-0190(89)90021-5 |
0.312 |
|
| 1989 |
Padberg M. The boolean quadric polytope: Some characteristics, facets and relatives Mathematical Programming. 45: 139-172. DOI: 10.1007/Bf01589101 |
0.496 |
|
| 1988 |
Padberg M, Rinaldi G. Branch-and-cut approach to a variant of the traveling salesman problem Journal of Guidance Control and Dynamics. 11: 436-440. DOI: 10.2514/3.20336 |
0.372 |
|
| 1988 |
Padberg M, Sung TY. A polynomial-time solution to Papadimitriou and Steiglitz's 'traps' Operations Research Letters. 7: 117-125. DOI: 10.1016/0167-6377(88)90077-6 |
0.48 |
|
| 1988 |
Padberg M. Total unimodularity and the Euler-subgraph problem Operations Research Letters. 7: 173-179. DOI: 10.1016/0167-6377(88)90024-7 |
0.475 |
|
| 1987 |
Padberg M, Rinaldi G. Optimization of a 532-city symmetric traveling salesman problem by branch and cut Operations Research Letters. 6: 1-7. DOI: 10.1016/0167-6377(87)90002-2 |
0.376 |
|
| 1986 |
Padberg M. A different convergence proof of the projective method for linear programming Operations Research Letters. 4: 253-257. DOI: 10.1016/0167-6377(86)90025-8 |
0.418 |
|
| 1985 |
Hoffman K, Padberg M. Lp-based combinatorial problem solving Annals of Operations Research. 4: 145-194. DOI: 10.1007/978-3-642-82450-0_3 |
0.521 |
|
| 1985 |
Padberg MW, van Roy TJ, Wolsey LA. VALID LINEAR INEQUALITIES FOR FIXED CHARGE PROBLEMS Operations Research. 33: 842-861. |
0.425 |
|
| 1983 |
Crowder H, Johnson EL, Padberg M. Solving Large-Scale Zero-One Linear Programming Problems Operations Research. 31: 803-834. DOI: 10.1287/Opre.31.5.803 |
0.542 |
|
| 1983 |
Cho DC, Johnson EL, Padberg M, Rao MR. On the Uncapacitated Plant Location Problem. I: Valid Inequalities and Facets Mathematics of Operations Research. 8: 579-589. DOI: 10.1287/Moor.8.4.579 |
0.385 |
|
| 1981 |
Johnson EL, Padberg MW. A note of the knapsack problem with special ordered sets Operations Research Letters. 1: 18-22. DOI: 10.1016/0167-6377(81)90019-5 |
0.431 |
|
| 1980 |
Padberg MW. (1, k)-configurations and facets for packing problems Mathematical Programming. 18: 94-99. DOI: 10.1007/BF01588301 |
0.321 |
|
| 1979 |
Padberg MW. Covering, Packing and Knapsack Problems Annals of Discrete Mathematics. 4: 265-287. DOI: 10.1016/S0167-5060(08)70831-8 |
0.453 |
|
| 1979 |
Grötschel M, Padberg MW. On the symmetric travelling salesman problem II: Lifting theorems and facets Mathematical Programming. 16: 281-302. DOI: 10.1007/BF01582117 |
0.317 |
|
| 1979 |
Grötschel M, Padberg MW. On the symmetric travelling salesman problem I: Inequalities Mathematical Programming. 16: 265-280. DOI: 10.1007/BF01582116 |
0.361 |
|
| 1977 |
Grötschel M, Padberg MW. Lineare Charakterisierungen von Travelling Salesman Problemen Zeitschrift FüR Operations Research. 21: 33-64. DOI: 10.1007/BF01918456 |
0.415 |
|
| 1976 |
Padberg MW. Almost integral polyhedra related to certain combinatorial optimization problems Linear Algebra and Its Applications. 15: 69-88. DOI: 10.1016/0024-3795(76)90079-3 |
0.318 |
|
| 1975 |
Balas E, Padberg M. On the Set-Covering Problem: II. An Algorithm for Set Partitioning Operations Research. 23: 74-90. DOI: 10.1287/Opre.23.1.74 |
0.455 |
|
| 1975 |
Grötschel M, Padberg MW. Partial linear characterizations of the asymmetric travelling salesman polytope Mathematical Programming. 8: 378-381. DOI: 10.1007/BF01580454 |
0.426 |
|
| 1974 |
Padberg MW, Rao MR. The travelling salesman problem and a class of polyhedra of diameter two Mathematical Programming. 7: 32-45. DOI: 10.1007/BF01585502 |
0.399 |
|
| 1974 |
Padberg MW. Perfect zero–one matrices Mathematical Programming. 6: 180-196. DOI: 10.1007/BF01580235 |
0.302 |
|
| Show low-probability matches. |