| One warehouse multiple retailer systems with vehicle routing costs S Anily, A Federgruen Management science 36 (1), 92-114, 1990 | 489 | 1990 |
| Simulated annealing methods with general acceptance probabilities S Anily, A Federgruen Journal of applied probability 24 (3), 657-667, 1987 | 240 | 1987 |
| Two-echelon distribution systems with vehicle routing costs and central inventories S Anily, A Federgruen Operations Research 41 (1), 37-47, 1993 | 235 | 1993 |
| The swapping problem S Anily, R Hassin Networks 22 (4), 419-433, 1992 | 158 | 1992 |
| The scheduling of maintenance service S Anily, CA Glass, R Hassin Discrete Applied Mathematics 82 (1-3), 27-42, 1998 | 157 | 1998 |
| Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries S Anily, J Bramel Naval Research Logistics (NRL) 46 (6), 654-670, 1999 | 113 | 1999 |
| The vehicle‐routing problem with delivery and back‐haul options S Anily Naval Research Logistics (NRL) 43 (3), 415-434, 1996 | 113 | 1996 |
| The traveling salesman problem with delivery and backhauls S Anily, G Mosheiov Operations Research Letters 16 (1), 11-18, 1994 | 111 | 1994 |
| Structured partitioning problems S Anily, A Federgruen Operations Research 39 (1), 130-149, 1991 | 106 | 1991 |
| Cooperation in service systems S Anily, M Haviv Operations Research 58 (3), 660-673, 2010 | 103 | 2010 |
| The cost allocation problem for the first order interaction joint replenishment model S Anily, M Haviv Operations research 55 (2), 292-302, 2007 | 101 | 2007 |
| Shipping multiple items by capacitated vehicles: An optimal dynamic programming approach S Anily, M Tzur Transportation Science 39 (2), 233-248, 2005 | 85 | 2005 |
| Ergodicity in parametric nonstationary Markov chains: An application to simulated annealing methods S Anily, A Federgruen Operations Research 35 (6), 867-874, 1987 | 82 | 1987 |
| Single-machine lot-sizing with uniform yields and rigid demands: robustness of the optimal solution S Anily IIE transactions 27 (5), 634-637, 1995 | 77 | 1995 |
| Worst-case analysis of heuristics for the bin packing problem with general cost structures S Anily, J Bramel, D Simchi-Levi Operations research 42 (2), 287-298, 1994 | 74 | 1994 |
| A 5/3-approximation algorithm for the clustered traveling salesman tour and path problems S Anily, J Bramel, A Hertz Operations Research Letters 24 (1-2), 29-35, 1999 | 72 | 1999 |
| Rejoinder to “Comments on One-warehouse multiple retailer systems with vehicle routing costs” S Anily, A Federgruen Management Science 37 (11), 1497-1499, 1991 | 68 | 1991 |
| An asymptotic 98.5%-effective lower bound on fixed partition policies for the inventory-routing problem S Anily, J Bramel Discrete Applied Mathematics 145 (1), 22-39, 2004 | 56 | 2004 |
| The general multi-retailer EOQ problem with vehicle routing costs S Anily European Journal of Operational Research 79 (3), 451-473, 1994 | 55 | 1994 |
| Multi-item replenishment and storage problem (MIRSP): heuristics and bounds S Anily Operations Research 39 (2), 233-243, 1991 | 53 | 1991 |
Julien BramelVerified email at columbia.edu
