Volume 30,
Number 1,
February 2002
- Kenneth R. Baker, Michael J. Magazine, George G. Polak:
Optimal block design models for course timetabling.
1-8
- Gerhard J. Woeginger:
An efficient algorithm for a class of constraint satisfaction problems.
9-16
- Dieter Fiems, Herwig Bruneel:
A note on the discretization of Little's result.
17-18
- Robert D. Foley, Byung Chun Park:
Optimal allocation of buffers and customers in a two-node cyclic network with multiple servers.
19-24
- Nam K. Kim, Seok Ho Chang, Kyung C. Chae:
On the relationships among queue lengths at arrival, departure, and random epochs in the discrete-time queue with D-BMAP arrivals.
25-32
- J. P. C. Blanc:
On the numerical inversion of busy-period related transforms.
33-42
- Edmond J. Vanderperre, Stanislav S. Makhanov:
On Gaver's parallel system sustained by a cold standby unit and attended by two repairmen.
43-48
- Siriphong Lawphongpanich:
A nontangential cutting plane algorithm.
49-56
- Robert D. Carr, Giuseppe Lancia:
Compact vs. exponential-size LP relaxations.
57-65
- C. T. Ng, T. C. Edwin Cheng, J. J. Yuan:
A note on the single machine serial batching scheduling problem to minimize maximum lateness with precedence constraints.
66-68
- Albert Corominas:
A remark about "A comment on consecutive-2-out-of-n systems".
69-70
Volume 30,
Number 2,
April 2002
Volume 30,
Number 3,
June 2002
- Ravindra K. Ahuja, James B. Orlin, Prabha Sharma, P. T. Sokkalingam:
A network simplex algorithm with O(n) consecutive degenerate pivots.
141-148
- Jörg Kalcsics, Stefan Nickel, Justo Puerto, Arie Tamir:
Algorithmic results for ordered median problems.
149-158
- David J. Rader Jr., Gerhard J. Woeginger:
The quadratic 0-1 knapsack problem with series-parallel support.
159-166
- Gerhard J. Woeginger:
Embeddings of planar graphs that minimize the number of long-face cycles.
167-168
- Brady Hunsaker, Martin W. P. Savelsbergh:
Efficient feasibility testing for dial-a-ride problems.
169-173
- Mohan L. Chaudhry, Bong K. Yoon, Kyung C. Chae:
Waiting-time distribution of a discrete-time multiserver queue with correlated arrivals and deterministic service times: D-MAP/D/k system.
174-180
- Anand Paul:
On bivariate dependence and the convex order.
181-188
- John D. Lamb, Russell C. H. Cheng:
Optimal allocation of runs in a simulation metamodel with several independent variables.
189-194
- Doo-Hyun Choi:
Cooperative mutation based evolutionary programming for continuous function optimization.
195-201
- Zhenghai Huang:
Sufficient conditions on nonemptiness and boundedness of the solution set of the P0 function nonlinear complementarity problem.
202-210
Volume 30,
Number 4,
August 2002
- Bart De Schutter, W. P. M. H. Heemels, Alberto Bemporad:
On the equivalence of linear complementarity problems.
211-222
- Félix Belzunce, Rosa E. Lillo, Franco Pellerey, Moshe Shaked:
Preservation of association in multivariate shock and claim models.
223-230
- Tomoyuki Kodera, Masakiyo Miyazawa:
An M/G/1 queue with Markov-dependent exceptional service times.
231-244
- David Perry, Morton J. M. Posner:
A mountain process with state dependent input and output and a correlated dam.
245-251
- Virginie Gabrel, Michel Minoux:
A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems.
252-264
- Hervé Kerivin, Ali Ridha Mahjoub:
Separation of partition inequalities for the (1, 2)-survivable network design problem.
265-268
- Leah Epstein, Lene M. Favrholdt:
Optimal preemptive semi-online scheduling to minimize makespan on two related machines.
269-275
- Alexander Kononov, Maxim Sviridenko:
A linear time approximation scheme for makespan minimization in an open shop with release dates.
276-280
Volume 30,
Number 5,
October 2002
- A. Brown, A. Gedlaman, A. Holder, S. Martinez:
An extension of the fundamental theorem of linear programming.
281-288
- Earl Barnes, Victoria Chen, Balaji Gopalakrishnan, Ellis L. Johnson:
A least-squares primal-dual algorithm for solving linear programming problems.
289-294
- Jerzy A. Filar, Eitan Altman, Konstantin Avrachenkov:
An asymptotic simplex method for singularly perturbed linear programs.
295-307
- Vidyadhar G. Kulkarni, Elena I. Tzenova:
Mean first passage times in fluid queues.
308-318
- Michael Sherman, David Goldsman:
Large-sample normality of the batch-means variance estimator.
319-326
- Alexander A. Ageev:
Improved approximation algorithms for multilevel facility location problems.
327-332
- Jiawei Zhang, Yinyu Ye:
A note on the maximization version of the multi-level facility location problem.
333-335
- Alain Billionnet:
Approximation algorithms for fractional knapsack problems.
336-342
- Yongpei Guan, Wen-Qiang Xiao, Raymond K. Cheung, Chung-Lun Li:
A multiprocessor task scheduling model for berth allocation: heuristic and worst-case analysis.
343-350
Volume 30,
Number 6,
December 2002
- Anat Kopzon, Gideon Weiss:
A push-pull queueing system.
351-359
- Antonio Gómez-Corral:
A matrix-geometric approximation for tandem queues with blocking and repeated attempts.
360-374
- Jesus R. Artalejo:
A note on the optimality of the N- and D-policies for the M/G/1 queue.
375-376
- Nelly Litvak, Ivo J. B. F. Adan:
On a class of order pick strategies in paternosters.
377-386
- Jinn-Tsair Teng, Horng-Jinh Chang, Chung-Yuan Dye, Cheng-Hsing Hung:
An optimal replenishment policy for deteriorating items with time-varying demand and partial backlogging.
387-393
- Jean B. Lasserre, Eduardo S. Zeron:
Solving the knapsack problem via Z-transform.
394-400
- Yifan Xu, Duan Li:
A nonlinear Lagrangian dual for integer programming.
401-407
- Zhiyi Tan, Yong He:
Semi-on-line problems on two identical machines with combined partial information.
408-414
- Leah Epstein, John Noga, Gerhard J. Woeginger:
On-line scheduling of unit time jobs with rejection: minimizing the total completion time.
415-420
Copyright © Tue Dec 1 16:35:35 2009
by Michael Ley (ley@uni-trier.de)
