|
Tijdschrift beschrijving
Alle jaargangen van het bijbehorende tijdschrift
Alle afleveringen van het bijbehorende jaargang
Alle artikelen van de bijbehorende aflevering
20 gevonden resultaten
| nr | titel | auteur | tijdschrift | jaar | jaarg. | afl. | pagina('s) | type |
| 1 | A 3-approximation algorithm for two-dimensional bin packing |
Zhang, Guochuan |
2005 |
33 | 2 |
p. 121-126 6 p. |
artikel |
|
| 2 | Analysis of a GI/M/1 queue with multiple working vacations |
Baba, Yutaka |
2005 |
33 | 2 |
p. 201-209 9 p. |
artikel |
|
| 3 | An optimal rounding gives a better approximation for scheduling unrelated machines |
Shchepin, Evgeny V. |
2005 |
33 | 2 |
p. 127-133 7 p. |
artikel |
|
| 4 | A note on the asymptotic behaviour of bottleneck problems |
Albrecher, Hansjörg |
2005 |
33 | 2 |
p. 183-186 4 p. |
artikel |
|
| 5 | Approximating k-hop minimum-spanning trees |
Althaus, Ernst |
2005 |
33 | 2 |
p. 115-120 6 p. |
artikel |
|
| 6 | A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access |
Bollapragada, Ramesh |
2005 |
33 | 2 |
p. 134-142 9 p. |
artikel |
|
| 7 | Capacity competition of make-to-order firms |
Chen, Hong |
2005 |
33 | 2 |
p. 187-194 8 p. |
artikel |
|
| 8 | Combinatorial approximation algorithms: a comparative review |
Woeginger, Gerhard J. |
2005 |
33 | 2 |
p. 210-215 6 p. |
artikel |
|
| 9 | Editorial Board |
2005 |
33 | 2 |
p. IFC- 1 p. |
artikel |
||
| 10 | Linear programming with variable matrix entries |
Serafini, Paolo |
2005 |
33 | 2 |
p. 165-170 6 p. |
artikel |
|
| 11 | Minimizing makespan on a single batching machine with release times and non-identical job sizes |
Li, Shuguang |
2005 |
33 | 2 |
p. 157-164 8 p. |
artikel |
|
| 12 | [No title] |
Strusevich, Vitaly |
2005 |
33 | 2 |
p. 217-219 3 p. |
artikel |
|
| 13 | [No title] |
Volgenant, A. |
2005 |
33 | 2 |
p. 216-217 2 p. |
artikel |
|
| 14 | [No title] |
Erkip, Nesim |
2005 |
33 | 2 |
p. 219-220 2 p. |
artikel |
|
| 15 | On stages and consistency checks in stochastic programming |
Gassmann, H.I. |
2005 |
33 | 2 |
p. 171-175 5 p. |
artikel |
|
| 16 | On the average sojourn time under M/M/1/SRPT |
Bansal, Nikhil |
2005 |
33 | 2 |
p. 195-200 6 p. |
artikel |
|
| 17 | Optimal preemptive scheduling on a fixed number of identical parallel machines |
Moukrim, Aziz |
2005 |
33 | 2 |
p. 143-150 8 p. |
artikel |
|
| 18 | Sparse certificates and removable cycles in l -mixed p -connected graphs |
Berg, Alex R. |
2005 |
33 | 2 |
p. 111-114 4 p. |
artikel |
|
| 19 | The complexity of machine scheduling for stability with a single disrupted job |
Leus, Roel |
2005 |
33 | 2 |
p. 151-156 6 p. |
artikel |
|
| 20 | Using xQx to model and solve the uncapacitated task allocation problem |
Lewis, Mark |
2005 |
33 | 2 |
p. 176-182 7 p. |
artikel |
20 gevonden resultaten