Volume 39; Issue 2

Operations Research Letters

Volume 39; Issue 2
2

On joint probabilistic constraints with Gaussian coefficient matrix

Year:
2011
Language:
english
File:
PDF, 245 KB
english, 2011
3

A well-solvable special case of the bounded knapsack problem

Year:
2011
Language:
english
File:
PDF, 196 KB
english, 2011
4

Solving large Steiner Triple Covering Problems

Year:
2011
Language:
english
File:
PDF, 316 KB
english, 2011
6

A branch-and-price approach for the partition coloring problem

Year:
2011
Language:
english
File:
PDF, 338 KB
english, 2011
8

A dynamic programming approach to adjustable robust optimization

Year:
2011
Language:
english
File:
PDF, 243 KB
english, 2011
10

Klee–Minty’s LP and upper bounds for Dantzig’s simplex method

Year:
2011
Language:
english
File:
PDF, 232 KB
english, 2011
11

Online lot-sizing problems with ordering, holding and shortage costs

Year:
2011
Language:
english
File:
PDF, 242 KB
english, 2011
12

The split closure of a strictly convex body

Year:
2011
Language:
english
File:
PDF, 317 KB
english, 2011
14

Single-path routing of stochastic flows in networks

Year:
2011
Language:
english
File:
PDF, 376 KB
english, 2011
16

Dynamic behavior of -out-of-:G systems

Year:
2011
Language:
english
File:
PDF, 256 KB
english, 2011
17

Editorial Board

Year:
2011
File:
PDF, 134 KB
2011