- Hanif D. Sherali, Cihan H. Tuncbilek:
**New reformulation linearization/convexification relaxations for univariate and multivariate polynomial programming problems.**1-9*Electronic Edition*(link) BibTeX - Vitaly A. Strusevich, L. A. Hall:
**An open shop scheduling problem with a non-bottleneck machine.**11-18*Electronic Edition*(link) BibTeX - Fangruo Chen, Yu-Sheng Zheng:
**Sensitivity analysis of an (s, S) inventory model.**19-23*Electronic Edition*(link) BibTeX - K. Szkatuza:
**The growth of multi-constraint random knapsacks with large right-hand sides of the constraints.**25-30*Electronic Edition*(link) BibTeX - Nan Zhu, Kevin A. Broughan:
**On dominated terms in the general knapsack problem.**31-37*Electronic Edition*(link) BibTeX - Jinxing Xie:
**Polynomial algorithms for single machine scheduling problems with financial constraints.**39-42*Electronic Edition*(link) BibTeX - Mohamed Haouari, Rym M'Hallah:
**Heuristic algorithms for the two-stage hybrid flowshop problem.**43-53*Electronic Edition*(link) BibTeX

- Joost P. Warners, Tamás Terlaky, Cornelis Roos, Benjamin Jansen:
**Potential reduction algorithms for structured combinatorial optimization problems.**55-64*Electronic Edition*(link) BibTeX - William S. Griffith:
**A note on the characterization of the Barlow and Wu continuum structure functions.**65-67*Electronic Edition*(link) BibTeX - Zhi-Long Chen, Qing Lu, Guochun Tang:
**Single machine scheduling with discretely controllable processing times.**69-76*Electronic Edition*(link) BibTeX - Jay B. Ghosh, Jatinder N. D. Gupta:
**Batch scheduling to minimize maximum lateness.**77-80*Electronic Edition*(link) BibTeX - A. Zaporozhets:
**A short proof of optimality of the Bottom Up algorithm for discrete resource allocation problems.**81-85*Electronic Edition*(link) BibTeX - John J. Hasenbein:
**Necessary conditions for global stability of multiclass queueing networks.**87-94*Electronic Edition*(link) BibTeX - Andreas Frey, Yoshitaka Takahashi:
**A note on an M/GI/1/N queue with vacation time and exhaustive service discipline.**95-100*Electronic Edition*(link) BibTeX - Frank N. Gouweleeuw:
**The loss probability in an overloaded queue using the dual queue.**101-106*Electronic Edition*(link) BibTeX

- John R. Birge, Kevin D. Glazebrook:
**Bounds on optimal values in stochastic scheduling.**107-114*Electronic Edition*(link) BibTeX - Clifford Stein, Joel Wein:
**On the existence of schedules that are near-optimal for both makespan and total weighted completion time.**115-122*Electronic Edition*(link) BibTeX - Dimitris Bertsimas, Chung-Piaw Teo:
**The parsimonious property of cut covering problems and its applications.**123-132*Electronic Edition*(link) BibTeX - Refael Hassin, Shlomi Rubinstein, Arie Tamir:
**Approximation algorithms for maximum dispersion.**133-137*Electronic Edition*(link) BibTeX - Jiang Chen, George Steiner:
**Approximation methods for discrete lot streaming in flow shops.**139-145*Electronic Edition*(link) BibTeX - J. L. Nazareth:
**Deriving potential functions via a symmetry principle for nonlinear equations.**147-152*Electronic Edition*(link) BibTeX - Irwin Greenberg:
**Markov chain approximation methods in a class of level-crossing problems.**153-158*Electronic Edition*(link) BibTeX

- Vernon Ning Hsu, Timothy J. Lowe, Arie Tamir:
**Structured**159-164*p*-facility location problems on the line solvable in polynomial time.*Electronic Edition*(link) BibTeX - Bo Chen, Arjen P. A. Vestjens:
**Scheduling on identical machines: How good is LPT in an on-line setting?**165-169*Electronic Edition*(link) BibTeX - Vladimir Kats, Eugene Levner:
**A strongly polynomial algorithm for no-wait cyclic robotic flowshop scheduling.**171-179*Electronic Edition*(link) BibTeX - P. Wu, Morton J. M. Posner:
**A level-crossing approach to the solution of the shortest-queue problem.**181-189*Electronic Edition*(link) BibTeX - Koichi Nakade, Katsuhisa Ohno, J. George Shanthikumar:
**Bounds and approximations for cycle times of a U-shaped production line.**191-200*Electronic Edition*(link) BibTeX - Nico M. van Dijk, Masakiyo Miyazawa:
**Error bounds on a practical approximation for finite tandem queues.**201-208*Electronic Edition*(link) BibTeX

- David R. Wood:
**An algorithm for finding a maximum clique in a graph.**211-217*Electronic Edition*(link) BibTeX - Zeev Nutov, Michal Penn:
**Faster approximation algorithms for weighted triconnectivity augmentation problems.**219-223*Electronic Edition*(link) BibTeX - Michel Burlet, Olivier Goldschmidt:
**A new and improved algorithm for the 3-cut problem.**225-227*Electronic Edition*(link) BibTeX - Jean-François Hêche, Thomas M. Liebling:
**Finding minimum area simple pentagons.**229-233*Electronic Edition*(link) BibTeX - Hans Kellerer, Vladimir Kotov, Maria Grazia Speranza, Zsolt Tuza:
**Semi on-line algorithms for the partition problem.**235-242*Electronic Edition*(link) BibTeX - Christian Ewerhart:
**Bayesian optimization and genericity.**243-248*Electronic Edition*(link) BibTeX - Makoto Doi, Yow-Mow Chen, Hideo Osawa:
**A queueing model in which arrival times are scheduled.**249-252*Electronic Edition*(link) BibTeX