Oper. Res. Lett. - researchr journal

1	--	7	Nilotpal Chakravarti, Albert P. M. Wagelmans. Calculation of stability radii for combinatorial optimization problems
9	--	11	Petra Schuurman. A fully polynomial approximation scheme for a scheduling problem with intree-type precedence delays
13	--	19	Eddie Cheng. Separating subdivision of bicycle wheel inequalities over cut polytopes
21	--	26	Geir Dahl. The 2-hop spanning tree problem
27	--	33	P. T. Sokkalingam, Y. P. Aneja. Lexicographic bottleneck combinatorial problems
35	--	40	Diego Klabjan, George L. Nemhauser, C. Tovey. The complexity of cover inequality separation
41	--	43	Gerhard J. Woeginger. A comment on a minmax location problem
45	--	51	Christian Kanzow, Masao Fukushima. Solving box constrained variational inequalities by using the natural residual with D-gap function globalization
53	--	61	Jianmin Jiang. A long-step primal-dual path-following method for semidefinite programming
63	--	70	Wheyming Tina Song, Chien-Chou Su. A three-class variance swapping technique for simulation experiments

External Links