Discrete Applied Mathematics |
Top 25 requested papers,
April 2002 - April 2004
[about]
|
#requests |
| 1 |
Nearly
on line scheduling of preemptive independent tasks
Eric Sanlaville |
626 |
| 2 |
Models,
relaxations and exact approaches for the capacitated vehicle routing problem
Paolo Toth and Daniele Vigo |
560 |
| 3 |
A
survey of very large-scale neighborhood search techniques
Ravindra K. Ahuja, Ozlem Ergun, James B. Orlin and Abraham P. Punnen |
548 |
| 4 |
Selected
topics on assignment problems
Rainer E. Burkard |
448 |
| 5 |
Production
planning problems in printed circuit board assembly
Yves Crama, Joris van de Klundert and Frits C.R. Spieksma |
398 |
| 6 |
Cutting
planes in integer and mixed integer programming
Hugues Marchand, Alexander Martin, Robert Weismantel and Laurence Wolsey |
393 |
| 7 |
Recent
advances on two-dimensional bin packing problems
Andrea Lodi, Silvano Martello and Daniele Vigo |
351 |
| 8 |
Optimally
balancing assembly lines with different workstations
Gaia Nicosia, Dario Pacciarelli and Andrea Pacifici |
327 |
| 9 |
Recognizing
DNA graphs is difficult
Rudi Pendavingh, Petra Schuurman and Gerhard J. Woeginger |
314 |
| 10 |
Scheduling
and constraint propagation
Peter Brucker |
313 |
| 11 |
A
fast algorithm for the maximum clique problem
Patric R. J. Ostergard |
294 |
| 12 |
The
vehicle routing problem with pickups and deliveries on some special graphs
Tali Eilam Tzoreff, Daniel Granot, Frieda Granot and Greys Sosic |
282 |
| 13 |
Tabu
search and finite convergence
Fred Glover and Said Hanafi |
263 |
| 14 |
The
algorithmics of folding proteins on lattices
Vijay Chandru, Abhi DattaSharma and V. S. Anil Kumar |
259 |
| 15 |
Efficient
generation of rotating workforce schedules
Nysret Musliu, Johannes Gartner and Wolfgang Slany |
247 |
| 16 |
Non-standard
approaches to integer programming
Karen Aardal, Robert Weismantel and Laurence A. Wolsey |
243 |
| 17 |
A
tabu search algorithm for scheduling a single robot in a job-shop environment
Johann Hurink and Sigrid Knust |
239 |
| 18 |
Single
machine scheduling with assignable due dates
Xiangtong Qi, Gang Yu and Jonathan F. Bard |
200 |
| 19 |
A
multi-phase constructive heuristic for the vehicle routing problem with
multiple trips*1
R. J. Petch and S. Salhi |
197 |
| 20 |
On
the convergence of generalized hill climbing algorithms
A. W. Johnson and S. H. Jacobson |
192 |
| 21 |
On
k-ary n-cubes: theory and applications
Weizhen Mao and David M. Nicol |
190 |
| 22 |
Bounds
for probabilistic integer programming problems
Darinka Dentcheva, Andras Prekopa and Andrzej Ruszczynski |
187 |
| 23 |
An
enumerative algorithm for the frequency assignment problem
Carlo Mannino and Antonio Sassano |
184 |
| 24 |
Semidefinite
programming for discrete optimization and matrix completion problems
Henry Wolkowicz and Miguel F. Anjos |
176 |
| 25 |
Parallel
machine scheduling with a common server
Nicholas G. Hall, Chris N. Potts and Chelliah Sriskandarajah |
176 |