Operations Research Letters |
Top 25 requested papers,
April 2002 - April 2004
[about]
|
#requests |
| 1 |
On
the nearest neighbor rule for the traveling salesman problem
Cor A. J. Hurkens and Gerhard J. Woeginger |
543 |
| 2 |
An
extension of the fundamental theorem of linear programming
A. Brown, A. Gedlaman, A. Holder and S. Martinez |
355 |
| 3 |
On
the two-dimensional Knapsack Problem
Alberto Caprara and Michele Monaci |
321 |
| 4 |
When
greediness fails: examples from stochastic scheduling
Marc Uetz |
320 |
| 5 |
An
efficient heuristic for inventory control when the customer is using a (s,S)
policy
Srinagesh Gavirneni |
294 |
| 6 |
A
push-pull queueing system
Anat Kopzon and Gideon Weiss |
286 |
| 7 |
Optimal
block design models for course timetabling
Kenneth R. Baker, Michael J. Magazine and George G. Polak |
282 |
| 8 |
Approximative
procedures for no-wait job shop scheduling
Christoph J. Schuster and Jose M. Framinan |
278 |
| 9 |
A
nonlinear Lagrangian dual for integer programming
Yifan Xu and Duan Li |
272 |
| 10 |
An
efficient algorithm for a class of constraint satisfaction problems
Gerhard J. Woeginger |
256 |
| 11 |
A
least-squares primal-dual algorithm for solving linear programming problems
Earl Barnes, Victoria Chen, Balaji Gopalakrishnan and Ellis. L. Johnson |
254 |
| 12 |
Models
for representing piecewise linear cost functions
Ahmet B. Keha, Jr. de Farias, Ismael R. and George L. Nemhauser |
241 |
| 13 |
Mirror
descent and nonlinear projected subgradient methods for convex optimization
Amir Beck and Marc Teboulle |
233 |
| 14 |
Material
compatibility constraints for make-to-order production planning
Michael O. Ball, Chien-Yu Chen and Zhen-Ying Zhao |
233 |
| 15 |
On
the single machine serial batching scheduling problem to minimize total
completion time with precedence constraints, release dates and identical
processing times
C. T. Ng, T. C. E. Cheng, J. J. Yuan and Z. H. Liu |
226 |
| 16 |
Foundation-penalty
cuts for mixed-integer programs
Fred Glover and Hanif D. Sherali |
225 |
| 17 |
Dynamic
staffing in a telephone call center aiming to immediately answer all calls
Ward Whitt |
224 |
| 18 |
A
bilevel programming approach to the travelling salesman problem
Patrice Marcotte, Gilles Savard and Frederic Semet |
219 |
| 19 |
A
branch and bound algorithm for the robust shortest path problem with interval
data
R. Montemanni, L. M. Gambardella and A. V. Donati |
218 |
| 20 |
Flood
search under the California Split rule
Y. Baryshnikov, E. Coffman, P. Jelenkovic, P. Momcilovic and D. Rubenstein |
216 |
| 21 |
An
improved branch and bound algorithm for single machine scheduling with deadlines
to minimize total weighted completion time
Yunpeng Pan |
207 |
| 22 |
A
class of on-line scheduling algorithms to minimize total completion time
X. Lu, R. A. Sitters and L. Stougie |
206 |
| 23 |
Optimal
facility layout design
Russell D. Meller, Venkat Narayanan and Pamela H. Vance |
205 |
| 24 |
A
maximum flow algorithm using MA ordering
Satoru Fujishige |
203 |
| 25 |
Continuous
benchmark selections
Jens Leth Hougaard and Hans Keiding |
203 |