External Links

    Journal: Oper. Res. Lett.

    Volume 10, Issue 9

    497 -- 500Thomas Christof, Michael Jünger, Gerhard Reinelt. A complete description of the traveling salesman polytope on 8 nodes
    501 -- 507S. Huang, Kenneth O. Kortanek. A note on a potential reduction algorithm for LP with simultaneous primal-dual updating
    509 -- 512Esther Frostig. On the optimality of static policy in stochastic open shop
    513 -- 518G. E. Martin. Negotiated price discounting of perishable inventories
    519 -- 523Stanislaw Zdrzalka. Scheduling jobs on a single machine with release dates, delivery times and controllable processing times: worst-case analysis
    525 -- 529Ravi Varadarajan. An optimal algorithm for 2 × n bottleneck transportation problems
    531 -- 534Robert J. Vanderbei. A brief description of ALPO
    535 -- 539Tetsuya Takine, Toshiharu Hasegawa. Average waiting time of a symmetric polling system under Bernoulli scheduling
    541 -- 547Yves Dallery, Don Towsley. Symmetry property of the throughput in closed tandem queueing networks with finite buffers

    Volume 10, Issue 8

    431 -- 435Peter W. Glynn, Ward Whitt. Estimating the asymptotic variance with batch means
    437 -- 443Peter W. Glynn, Philip Heidelberger. Analysis of initial transient deletion for replicated steady-state simulations
    445 -- 452Pirooz Vakili. Using a standard clock technique for efficient simulation
    453 -- 459Jhitti Chiarawongse, Mandyam M. Srinivasan. On pseudo-conservation laws for the cyclic server system with compound Poisson arrivals
    461 -- 466Yahya Fathi. SQVAM: A variance minimizing algorithm
    467 -- 472Nicholas G. Hall, Wieslaw Kubiak. Proof of a conjecture of Schrage about the completion time variance problem
    473 -- 480Eugeniusz Nowicki, Czeslaw Smutnicki. Worst-case analysis of Dannenbring's algorithm for flow-shop scheduling
    481 -- 487Harold P. Benson. Complete efficiency and the initialization of algorithms for multiple objective programming
    489 -- 495Nam-kee Chung, Dong-wan Tcha. A dual algorithm for submodular flow problems

    Volume 10, Issue 7

    369 -- 376Lan Zhao, Stella Dafermos. General economic equilibrium and variational inequalities
    377 -- 382A. M. H. Gerards. Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
    383 -- 387Donald Goldfarb, Jianxiu Hao. On strongly polynomial variants of the network simplex algorithm for the maximum flow problem
    389 -- 393John A. Kaliski, Yinyu Ye. Convergence behavior of Karmarkar's projective algorithm for solving a simple linear program
    395 -- 402Refael Hassin, Arie Tamir. Improved complexity bounds for location problems on the real line
    403 -- 409Pey-Chun Chen, Pierre Hansen, Brigitte Jaumard. On-line and off-line vertex enumeration by adjacency lists
    411 -- 415A. Hertz. Cosine: A new graph coloring algorithm
    417 -- 419Krzysztof Dudzinski. A note on dominance relation in unbounded knapsack problems
    421 -- 427Enrique Ballestero, Carlos Romero. A theorem connecting utility function optimization and compromise programming
    429 -- 0Lawrence W. Robinson. Baseball playoff eliminations: An application of linear programming

    Volume 10, Issue 6

    309 -- 312J. R. Rajasekera, Shu-Cherng Fang. On the convex programming approach to linear programming
    313 -- 314Jeremy Spinrad. Note on recognition of matroid systems
    315 -- 322George L. Nemhauser, Sungsoo Park. A polyhedral approach to edge coloring
    323 -- 327Le D. Muu, Werner Oettli. An algorithm for indefinite quadratic programming with convex constraints
    329 -- 334Kelly J. Hayhurst, Douglas R. Shier. A factoring approach for the stochastic shortest path problem
    335 -- 341David Perry, Morton J. M. Posner. Determining the control limit policy in a replacement model with linear restoration
    343 -- 351Nico M. van Dijk. 'Stop = recirculate' for exponential product form queueing networks with departure blocking
    353 -- 362Don Towsley, Satish K. Tripathi. A single server priority queue with server failures and queue flushing
    363 -- 368Hanoch Levy. A note on the complexity of Swartz's method for calculating the expected delay in non-symmetric cyclic polling systems

    Volume 10, Issue 5

    247 -- 254Masakazu Kojima, Nimrod Megiddo, Toshihito Noma, Akiko Yoshise. A unified approach to interior point algorithms for linear complementarity problems: A summary
    255 -- 263Bennett L. Fox, David Goldsman, James J. Swain. Spaced batch means
    265 -- 272Bharat Doshi. Analysis of a two phase queueing system with general service times
    273 -- 280Susan H. Xu. Minimizing expected makespans of multi-priority classes of jobs on uniform processors
    281 -- 284Chris N. Potts, David B. Shmoys, David P. Williamson. Permutation vs. non-permutation flow shop schedules
    285 -- 290Douglas A. Miller, Steven W. Zucker. Copositive-plus Lemke algorithm solves polymatrix games
    291 -- 295J. A. Hoogeveen. Analysis of Christofides' heuristic: Some paths are more difficult than cycles
    297 -- 302Y. June Wu, J. David Fuller. Convergence of multiperiod equilibrium calculations, with geometric distributed lag demand
    303 -- 308Rainer E. Burkard, Franz Rendl. Lexicographic bottleneck problems

    Volume 10, Issue 4

    183 -- 187Hanan Luss. A nonlinear minimax allocation problem with multiple knapsack constraints
    189 -- 192S. Zhang. On anti-cycling pivoting rules for the simplex method
    193 -- 202Meir Herzberg, Uri Yechiali. Criteria for selecting the relaxation factor of the value iteration algorithm for undiscounted Markov and semi-Markov decision processes
    203 -- 209Harold P. Benson, Yasemin Aksoy. Using efficient feasible directions in interactive multiple objective linear programming
    211 -- 219Horst W. Hamacher, Franz Rendl. Color constrained combinatorial optimization problems
    221 -- 224Katarína Cechlárová. The uniquely solvable bipartite matching problem
    225 -- 232Hideaki Takagi, Yoshitaka Takahashi. Priority queues with batch Poisson arrivals
    233 -- 240Anat Levy, Hanoch Levy. Lock and no-lock mortgage plans: Is it only a matter of risk shifting?
    241 -- 243F. K. Hwang, Y. C. Yao. A direct argument for Kaplansky's theorem on a cyclic arrangement and its generalization

    Volume 10, Issue 3

    119 -- 128R. Kipp Martin. Using separation algorithms to generate mixed integer model reformulations
    129 -- 136Jeremy F. Shapiro. Convergent duality for the traveling salesman problem
    137 -- 141Ubaldo M. García-Palomares, William Colmenares. On the minimization of a quasi-concave function subject to linear constraints
    143 -- 152Ariel Orda, Raphael Rom. Location of central nodes in time varying computer networks
    153 -- 158Jianzhong Du, Joseph Y.-T. Leung. Minimizing the number of late jobs on unrelated machines
    159 -- 163Eugeniusz Toczylowski, Krzysztof Pienkosz. Restrictive aggregation of items in multi-stage production systems
    165 -- 171Francis J. Nourie, Enrique R. Venta. Finding optimal line balances with OptPack
    173 -- 176Joseph F. Pekny, Donald L. Miller, Daniel Stodolsky. A note on exploiting the Hamiltonian cycle problem substructure of the Asymmetric Traveling Salesman Problem
    177 -- 181Zyukiti Ikeda. Mean waiting time of a Gamma/Gamma/1 queue

    Volume 10, Issue 2

    61 -- 65Hanif D. Sherali. On the equivalence between some shortest path algorithms
    67 -- 74Lawrence W. Robinson. Baseball playoff eliminations: An application of linear programming
    75 -- 81Krzysztof C. Kiwiel. A tilted cutting plane proximal bundle method for convex nondifferentiable optimization
    83 -- 86José Claudio Geromel, Paulo Augusto Valente Ferreira. An upper bound on properly efficient solutions in multiobjective optimization
    87 -- 93David Fernández-Baca, S. Srinivasan. Constructing the minimization diagram of a two-parameter problem
    95 -- 97Zvi Rosberg, H. Richard Gail. ASTA implies an M/G/1-like load decomposition for a server with vacations
    99 -- 101Sudha Jain, J. G. C. Templeton. Confidence interval for M/M/2 queue with heterogeneous servers
    103 -- 112Yves De Serres. Simultaneous optimization of flow control and scheduling in a single server queue with two job classes
    113 -- 117Michel X. Goemans, Kalyan T. Talluri. 2-Change for k-connected networks

    Volume 10, Issue 1

    1 -- 7Andrew C. Pan, Ranga V. Ramasesh, Jack C. Hayya, J. Keith Ord. Multiple sourcing: The determination of lead times
    9 -- 15Dominique de Werra, Jacek Blazewicz, Wieslaw Kubiak. A preemptive open shop scheduling problem with one resource
    17 -- 22J. George Shanthikumar, Genji Yamazaki, Hirotaka Sakasegawa. Characterization of optimal order of servers in a tandem queue with blocking
    23 -- 26Takahito Kuno, Hiroshi Konno, Eitan Zemel. A linear-time algorithm for solving continuous maximin knapsack problems
    27 -- 36Martin Desrochers, Gilbert Laporte. Improvements and extensions to the Miller-Tucker-Zemlin subtour elimination constraints
    37 -- 41David L. Applegate, William J. Cook, S. Thomas McCormick. Integral infeasibility and testing total dual integrality
    43 -- 48C. W. Duin, A. Volgenant. Minimum deviation and balanced optimization: A unified approach
    49 -- 55Don Towsley, François Baccelli. Comparisons of service disciplines in a tandem queueing network with real time constraints
    57 -- 60James V. Burke, Michael C. Ferris. Characterization of solution sets of convex programs
    runs on