Journal: Oper. Res. Lett.

Volume 16, Issue 5

245 -- 254Ulrich Pferschy, Rüdiger Rudolf, Gerhard J. Woeginger. Monge matrices make maximization manageable
255 -- 263George L. Nemhauser, Pamela H. Vance. Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
265 -- 269Michael Patriksson. On the convergence of descent methods for monotone variational inequalities
271 -- 275Jay B. Ghosh. Batch scheduling to minimize total completion time
277 -- 283Joanna Józefowska, Bernd Jurisch, Wieslaw Kubiak. Scheduling shops to minimize the weighted number of late jobs
285 -- 290Z. Khalil, Gennadi Falin. Stochastic inequalities for M/G/1 retrial queues
291 -- 297Igor Averbakh, Oded Berman. Categorized bottleneck-minisum path problems on networks
299 -- 301Julian Scott Yeomans. A comment on "A simple sequencing algorithm for mixed-model assembly lines in just-in-time production systems"

Volume 16, Issue 4

183 -- 189Michel X. Goemans, David P. Williamson. Approximating minimum-cost graph problems with spanning tree edges
191 -- 198Svatopluk Poljak, Zsolt Tuza. The expected relative error of the polyhedral approximation of the max-cut problem
199 -- 208Awi Federgruen, Gur Mosheiov. Greedy heuristics for single-machine scheduling problems with general earliness and tardiness costs
209 -- 219George S. Fishman. Choosing sample path length and number of sample paths when starting in steady state
221 -- 230Bo Chen, André van Vliet, Gerhard J. Woeginger. New lower and upper bounds for on-line scheduling
231 -- 239Seong-in Kim, In-Chan Choi. A simple variational problem for a moving vehicle
241 -- 244Wen Lea Pearn. Solvable cases of the k-person Chinese postman problem

Volume 16, Issue 3

121 -- 127Hsin-Der Chen, Panos M. Pardalos, Michael A. Saunders. The simplex algorithm with a new primal and dual pivot rule
129 -- 137J. A. Hoogeveen, Jan Karel Lenstra, Bart Veltman. Three, four, five, six, or the complexity of scheduling with communication delays
139 -- 147Robin Lougee-Heimer, Warren P. Adams, Douglas R. Shier. Some applications of nonnegative linear systems: Farkas strikes again
149 -- 158Chung-Yee Lee, George L. Vairaktarakis. Minimizing makespan in hybrid flowshops
159 -- 166Kaj Madsen, Hans Bruun Nielsen, Mustafa Ç. Pinar. 1 solutions to overdetermined systems of linear equations
167 -- 176Shaul K. Bar-Lev, Mahmut Parlar, David Perry. On the EOQ model with inventory-level-dependent demand rate and random yield
177 -- 181Karin Aarssen, Nico M. van Dijk. A note on jackson networks with state-dependent rejection probabilities

Volume 16, Issue 2

61 -- 66Shinji Mizuno. A predictor-corrector infeasible-interior-point algorithm for linear programming
67 -- 77A. Melman. A new linesearch method for quadratically constrained convex programming
79 -- 86Dorit S. Hochbaum, Dan Landy. Scheduling with batching: minimizing the weighted number of tardy jobs
87 -- 99Erick D. Wikum, Donna Crystal Llewellyn, George L. Nemhauser. One-machine generalized precedence constrained scheduling problems
101 -- 113Kenneth D. Boese, Andrew B. Kahng, Sudhakar Muddu. A new adaptive multi-start technique for combinatorial global optimizations
115 -- 119S. Kalpakam, K. P. Sapna. Continuous review (s, S) inventory system with random lifetimes and positive leadtimes

Volume 16, Issue 1

1 -- 9Bruce W. Schmeiser, Michael R. Taaffe. Time-dependent queueing network approximations as simulation external control variates
11 -- 18Shoshana Anily, Gur Mosheiov. The traveling salesman problem with delivery and backhauls
19 -- 25Wansoo T. Rhee. Boundary effects in the traveling salesperson problem
27 -- 32Wansoo T. Rhee. On the fluctuations of simple matching
33 -- 40Naoki Makimoto, Ikuo Nakagawa, Akihisa Tamura. An efficient algorithm for finding the minimum norm point in the convex hull of a finite point set in the plane
41 -- 46Kyung C. Chae, Tae Sung Kim. Reversed absorbing Markov chain: A simple path approach
47 -- 49Pranay Chaudhuri. Finding maximum matching for bipartite graphs in parallel
51 -- 59De-Ron Liang, Rong-Hong Jan. Reliability analysis of a simple replicated and-fork/and-join graph