| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A 2-approximation algorithm for interval data minmax regret sequencing problems with the total flow time criterion
|
Kasperski, Adam
|
|
2008
|
36 |
3 |
p. 343-344
2 p.
|
artikel
|
| 2 |
Adaptive search with stochastic acceptance probabilities for global optimization
|
Ghate, Archis
|
|
2008
|
36 |
3 |
p. 285-290
6 p.
|
artikel
|
| 3 |
Additive and multiplicative tolerance in multiobjective linear programming
|
Hladík, Milan
|
|
2008
|
36 |
3 |
p. 393-396
4 p.
|
artikel
|
| 4 |
An algorithm for single-item economic lot-sizing problem with general inventory cost, non-decreasing capacity, and non-increasing setup and production cost
|
Chen, Shaoxiang
|
|
2008
|
36 |
3 |
p. 300-302
3 p.
|
artikel
|
| 5 |
An O ( n 2 ) algorithm for lot sizing with inventory bounds and fixed costs
|
Atamtürk, Alper
|
|
2008
|
36 |
3 |
p. 297-299
3 p.
|
artikel
|
| 6 |
A note on characterizations of the Natvig structure functions
|
Meng, Fan C.
|
|
2008
|
36 |
3 |
p. 377-380
4 p.
|
artikel
|
| 7 |
Approximate formulations for 0-1 knapsack sets
|
Bienstock, Daniel
|
|
2008
|
36 |
3 |
p. 317-320
4 p.
|
artikel
|
| 8 |
A short proof of the VPN Tree Routing Conjecture on ring networks
|
Grandoni, Fabrizio
|
|
2008
|
36 |
3 |
p. 361-365
5 p.
|
artikel
|
| 9 |
Batch processor sharing with hyper-exponential service time
|
Osipova, Natalia
|
|
2008
|
36 |
3 |
p. 372-376
5 p.
|
artikel
|
| 10 |
Complexity of single machine scheduling problems under scenario-based uncertainty
|
Aloulou, Mohamed Ali
|
|
2008
|
36 |
3 |
p. 338-342
5 p.
|
artikel
|
| 11 |
Construction of balanced sports schedules using partitions into subleagues
|
Geinoz, A.
|
|
2008
|
36 |
3 |
p. 279-282
4 p.
|
artikel
|
| 12 |
Editorial Board
|
|
|
2008
|
36 |
3 |
p. IFC-
1 p.
|
artikel
|
| 13 |
Efficient nested pricing in the simplex algorithm
|
Pan, Ping-Qi
|
|
2008
|
36 |
3 |
p. 309-313
5 p.
|
artikel
|
| 14 |
Feasibility of home–away-pattern sets for round robin tournaments
|
Briskorn, Dirk
|
|
2008
|
36 |
3 |
p. 283-284
2 p.
|
artikel
|
| 15 |
Lower bounds for randomized direct search with isotropic sampling
|
Jägersküpper, Jens
|
|
2008
|
36 |
3 |
p. 327-332
6 p.
|
artikel
|
| 16 |
On a generalization of the Gallai–Roy–Vitaver theorem to the bandwidth coloring problem
|
Gendron, Bernard
|
|
2008
|
36 |
3 |
p. 345-350
6 p.
|
artikel
|
| 17 |
On stochastic lot-sizing problems with random lead times
|
Huang, Kai
|
|
2008
|
36 |
3 |
p. 303-308
6 p.
|
artikel
|
| 18 |
Optimal design of hierarchical networks with free main path extremes
|
Obreque, Carlos
|
|
2008
|
36 |
3 |
p. 366-371
6 p.
|
artikel
|
| 19 |
Persuasive advertising under Bertrand competition: A differential game
|
Cellini, Roberto
|
|
2008
|
36 |
3 |
p. 381-384
4 p.
|
artikel
|
| 20 |
Profit-based latency problems on the line
|
Coene, Sofie
|
|
2008
|
36 |
3 |
p. 333-337
5 p.
|
artikel
|
| 21 |
Rounding to an integral program
|
Hassin, Refael
|
|
2008
|
36 |
3 |
p. 321-326
6 p.
|
artikel
|
| 22 |
Source location in undirected and directed hypergraphs
|
Bernáth, Attila
|
|
2008
|
36 |
3 |
p. 355-360
6 p.
|
artikel
|
| 23 |
The agency problem between the owner and the manager in real investment: The bonus–audit relationship
|
Nishihara, Michi
|
|
2008
|
36 |
3 |
p. 291-296
6 p.
|
artikel
|
| 24 |
The equivalence of semidefinite relaxations of polynomial 0–1 and ± 1 programs via scaling
|
Cheung, Kevin K.H.
|
|
2008
|
36 |
3 |
p. 314-316
3 p.
|
artikel
|
| 25 |
The p -median polytope of Y -free graphs: An application of the matching theory
|
Stauffer, Gautier
|
|
2008
|
36 |
3 |
p. 351-354
4 p.
|
artikel
|
| 26 |
The SC 1 property of the squared norm of the SOC Fischer–Burmeister function
|
Chen, Jein-Shan
|
|
2008
|
36 |
3 |
p. 385-392
8 p.
|
artikel
|
Tijdschrift beschrijving