Oper. Res. Lett. - researchr journal

researchr

You are not signed in
Sign in
Sign up

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

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

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

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

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

runs on WebDSL