Operations Research Letters logo Elsevier logo

Publisher: Elsevier

Related content
Volume 32, Number 3, May 2004

< previous issue | all issues

Editorial Board
pp. CO2-CO2(1)

Flood search under the California Split rule
pp. 199-206(8)
Authors: Baryshnikov Y.; Coffman E.; Jelenkovic P.; Momcilovic P.; Rubenstein D.

Cutting planes from a mixed integer Farkas lemma
pp. 207-211(5)
Authors: Koppe M.; Weismantel R.

Finding 2-edge connected spanning subgraphs
pp. 212-216(5)
Author: Huh W.T.

Local approximations for maximum partial subgraph problem
pp. 217-224(8)
Authors: Monnot J.; Paschos V.T.; Toulouse S.

A branch and bound algorithm for the robust shortest path problem with interval data
pp. 225-232(8)
Authors: Montemanni R.; Gambardella L.M.; Donati A.V.

A bilevel programming approach to the travelling salesman problem
pp. 240-248(9)
Authors: Marcotte P.; Savard G.; Semet F.

Preemptive scheduling of equal-length jobs to maximize weighted throughput
pp. 258-264(7)
Authors: Baptiste P.; Chrobak M.; Durr C.; Jawor W.; Vakhania N.

Approximations for Markovian multi-class queues with preemptive priorities
pp. 273-282(10)
Authors: van der Heijden M.; van Harten A.; Sleptchenko A.

On the robustness of batching estimators
pp. 293-298(6)
Authors: Yeh Y.; Schmeiser B.

< previous issue | all issues

Key

Free Content
Free content
New Content
New content
Open Access Content
Open access content
Subscribed Content
Subscribed content
Free Trial Content
Free trial content

Text size:

A | A | A | A
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages. print icon Print this page