-
1
-
-
0003515463
-
-
Prentice-hall, Englewood Cliffs, NJ
-
Ahuja R.K., Magnanti T.L., and Orlin J.B. Network Flows-Theory, Algorithms, and Applications (1993), Prentice-hall, Englewood Cliffs, NJ
-
(1993)
Network Flows-Theory, Algorithms, and Applications
-
-
Ahuja, R.K.1
Magnanti, T.L.2
Orlin, J.B.3
-
3
-
-
0028730104
-
A fast algorithm for the maximum weight clique problem
-
Babel L. A fast algorithm for the maximum weight clique problem. Computing 52 (1994) 31-38
-
(1994)
Computing
, vol.52
, pp. 31-38
-
-
Babel, L.1
-
4
-
-
3042729845
-
Tight bounds on the competitive ratio on accomodating sequences for the seat reservation problem
-
Bach E., Boyar J., Epstein L., Favrholdt L.M., Jiang T., Larsen K.S., Lin G.-H., and van Stee R. Tight bounds on the competitive ratio on accomodating sequences for the seat reservation problem. Journal of Scheduling 6 (2003) 131-147
-
(2003)
Journal of Scheduling
, vol.6
, pp. 131-147
-
-
Bach, E.1
Boyar, J.2
Epstein, L.3
Favrholdt, L.M.4
Jiang, T.5
Larsen, K.S.6
Lin, G.-H.7
van Stee, R.8
-
7
-
-
0141668007
-
Reactive local search for the maximum clique problem
-
Battiti R., and Protasi M. Reactive local search for the maximum clique problem. Algorithmica 29 (2001) 610-637
-
(2001)
Algorithmica
, vol.29
, pp. 610-637
-
-
Battiti, R.1
Protasi, M.2
-
8
-
-
0036253499
-
Approximating the throughput of multiple machines in real-time scheduling
-
Bar-Noy A., Bar-Yehuda R., Freund A., Naor J.S., and Schieber B. Approximating the throughput of multiple machines in real-time scheduling. SIAM Journal on Computing 31 (2001) 331-352
-
(2001)
SIAM Journal on Computing
, vol.31
, pp. 331-352
-
-
Bar-Noy, A.1
Bar-Yehuda, R.2
Freund, A.3
Naor, J.S.4
Schieber, B.5
-
9
-
-
0001334002
-
A unified approach to approximating resource allocation and scheduling
-
Bar-Noy A., Guha S., Naor J.S., and Schieber B. A unified approach to approximating resource allocation and scheduling. Journal of the ACM 48 (2001) 1069-1090
-
(2001)
Journal of the ACM
, vol.48
, pp. 1069-1090
-
-
Bar-Noy, A.1
Guha, S.2
Naor, J.S.3
Schieber, B.4
-
10
-
-
0028193049
-
On the power of randomization in on-line algorithms
-
Ben-David S., Borodin A., Karp R., Tardos G., and Wigderson A. On the power of randomization in on-line algorithms. Algorithmica 11 (1994) 2-14
-
(1994)
Algorithmica
, vol.11
, pp. 2-14
-
-
Ben-David, S.1
Borodin, A.2
Karp, R.3
Tardos, G.4
Wigderson, A.5
-
12
-
-
0000462690
-
On standard quadratic optimization problem
-
Bomze I.M. On standard quadratic optimization problem. Journal of Global Optimization 13 (1998) 369-387
-
(1998)
Journal of Global Optimization
, vol.13
, pp. 369-387
-
-
Bomze, I.M.1
-
13
-
-
0002590155
-
The maximum clique problem
-
Du D.-Z., and Pardalos P.M. (Eds), Kluwer Academic Publishers, Dordrecht
-
Bomze I.M., Budinich M., Pardalos P.M., and Pelillo M. The maximum clique problem. In: Du D.-Z., and Pardalos P.M. (Eds). Handbook of Combinatorial Optimization (1999), Kluwer Academic Publishers, Dordrecht 1-74
-
(1999)
Handbook of Combinatorial Optimization
, pp. 1-74
-
-
Bomze, I.M.1
Budinich, M.2
Pardalos, P.M.3
Pelillo, M.4
-
14
-
-
0041858636
-
Global escape strategies for maximizing quadratic forms over a simplex
-
Bomze I.M. Global escape strategies for maximizing quadratic forms over a simplex. Journal of Global Optimization 11 (1997) 325-338
-
(1997)
Journal of Global Optimization
, vol.11
, pp. 325-338
-
-
Bomze, I.M.1
-
16
-
-
0008781180
-
The seat reservation problem
-
Boyar J., and Larsen K.S. The seat reservation problem. Algorithmica 25 (1999) 403-417
-
(1999)
Algorithmica
, vol.25
, pp. 403-417
-
-
Boyar, J.1
Larsen, K.S.2
-
18
-
-
0028746924
-
The k-track assignment problem
-
Brucker P., and Nordmann L. The k-track assignment problem. Computing 52 (1994) 97-122
-
(1994)
Computing
, vol.52
, pp. 97-122
-
-
Brucker, P.1
Nordmann, L.2
-
19
-
-
0012328903
-
Bounding the power of preemption in randomized scheduling
-
Canetti R., and Irani S. Bounding the power of preemption in randomized scheduling. SIAM Journal on Computing 27 (1998) 993-1015
-
(1998)
SIAM Journal on Computing
, vol.27
, pp. 993-1015
-
-
Canetti, R.1
Irani, S.2
-
21
-
-
0005284309
-
When is the classroom assignment problem hard?
-
Carter M.W., and Tovey C.A. When is the classroom assignment problem hard?. Operations Research 40 (1992) 28-39
-
(1992)
Operations Research
, vol.40
, pp. 28-39
-
-
Carter, M.W.1
Tovey, C.A.2
-
22
-
-
85023843371
-
Allocation of bandwidth and storage
-
Chen B., Hassin R., and Tzur M. Allocation of bandwidth and storage. IIE Transactions 34 (2002) 501-507
-
(2002)
IIE Transactions
, vol.34
, pp. 501-507
-
-
Chen, B.1
Hassin, R.2
Tzur, M.3
-
23
-
-
0142183786
-
More reliable protein NMR peak assignment via improved 2-interval scheduling
-
Chen Z.Z., Jiang T., Lin G.H., Rizzi R., Wen J.J., Xu D., and Xu Y. More reliable protein NMR peak assignment via improved 2-interval scheduling. Lecture Notes in Computer Science 2832 (2003) 580-592
-
(2003)
Lecture Notes in Computer Science
, vol.2832
, pp. 580-592
-
-
Chen, Z.Z.1
Jiang, T.2
Lin, G.H.3
Rizzi, R.4
Wen, J.J.5
Xu, D.6
Xu, Y.7
-
24
-
-
0037453352
-
Approximation algorithms for NMR spectral peak assignment
-
Chen Z.-Z., Jiang T., Lin G., Wen J., Xu D., Xu J., and Xu Y. Approximation algorithms for NMR spectral peak assignment. Theoretical Computer Science 299 (2003) 211-229
-
(2003)
Theoretical Computer Science
, vol.299
, pp. 211-229
-
-
Chen, Z.-Z.1
Jiang, T.2
Lin, G.3
Wen, J.4
Xu, D.5
Xu, J.6
Xu, Y.7
-
25
-
-
0043231182
-
A generalization of chordal graphs and the maximum clique problem
-
Chmeiss A., and Jégou P. A generalization of chordal graphs and the maximum clique problem. Information Processing Letters 62 (1997) 61-66
-
(1997)
Information Processing Letters
, vol.62
, pp. 61-66
-
-
Chmeiss, A.1
Jégou, P.2
-
26
-
-
31244432687
-
Recognizing Berge graphs
-
Chudnovsky M., Cornuéjols G., Liu X., Seymour P., and Vušković K. Recognizing Berge graphs. Combinatorica 25 (2005) 143-187
-
(2005)
Combinatorica
, vol.25
, pp. 143-187
-
-
Chudnovsky, M.1
Cornuéjols, G.2
Liu, X.3
Seymour, P.4
Vušković, K.5
-
31
-
-
0012032772
-
Fixed job scheduling with two types of processors
-
Dondeti V.R., and Emmons H. Fixed job scheduling with two types of processors. Operations Research 40 (1992) S76-S85
-
(1992)
Operations Research
, vol.40
-
-
Dondeti, V.R.1
Emmons, H.2
-
32
-
-
0001488083
-
On the complexity of timetable and multicommodity flow problems
-
Even S., Itai A., and Shamir A. On the complexity of timetable and multicommodity flow problems. SIAM Journal on Computing 5 (1976) 691-703
-
(1976)
SIAM Journal on Computing
, vol.5
, pp. 691-703
-
-
Even, S.1
Itai, A.2
Shamir, A.3
-
33
-
-
84949748565
-
Simple algorithms for a weighted interval selection problem
-
Erlebach T., and Spieksma F.C.R. Simple algorithms for a weighted interval selection problem. Lecture Notes in Computer Science 1969 (2001) 228-240
-
(2001)
Lecture Notes in Computer Science
, vol.1969
, pp. 228-240
-
-
Erlebach, T.1
Spieksma, F.C.R.2
-
34
-
-
0037219868
-
Interval selection: Applications, algorithms, and lower bounds
-
Erlebach T., and Spieksma F.C.R. Interval selection: Applications, algorithms, and lower bounds. Journal of Algorithms 46 (2003) 27-53
-
(2003)
Journal of Algorithms
, vol.46
, pp. 27-53
-
-
Erlebach, T.1
Spieksma, F.C.R.2
-
35
-
-
0347653511
-
A greedy on-line algorithm for the k-track assignment problem
-
Faigle U., Kern W., and Nawijn W.M. A greedy on-line algorithm for the k-track assignment problem. Journal of Algorithms 31 (1999) 196-210
-
(1999)
Journal of Algorithms
, vol.31
, pp. 196-210
-
-
Faigle, U.1
Kern, W.2
Nawijn, W.M.3
-
38
-
-
35248824095
-
Searching for maximum cliques with ant colony optimization
-
Fenet S., and Solnon C. Searching for maximum cliques with ant colony optimization. Lecture Notes in Computer Science 2611 (2003) 236-245
-
(2003)
Lecture Notes in Computer Science
, vol.2611
, pp. 236-245
-
-
Fenet, S.1
Solnon, C.2
-
39
-
-
0012266595
-
Approximation algorithms for fixed job schedule problems
-
Fischetti M., Martello S., and Toth P. Approximation algorithms for fixed job schedule problems. Operations Research 40 (1992) S96-S108
-
(1992)
Operations Research
, vol.40
-
-
Fischetti, M.1
Martello, S.2
Toth, P.3
-
40
-
-
34247872179
-
On chain and antichain families of a partially ordered set
-
Frank A. On chain and antichain families of a partially ordered set. Journal of Combinatorial Theory Series B 29 (1980) 176-184
-
(1980)
Journal of Combinatorial Theory Series B
, vol.29
, pp. 176-184
-
-
Frank, A.1
-
41
-
-
0000609227
-
Exploiting sparsity in primal-dual interior-point methods for semidefinite programming
-
Fujisawa K., Kojima M., and Nakata K. Exploiting sparsity in primal-dual interior-point methods for semidefinite programming. Mathematical Programming 79 (1997) 235-253
-
(1997)
Mathematical Programming
, vol.79
, pp. 235-253
-
-
Fujisawa, K.1
Kojima, M.2
Nakata, K.3
-
42
-
-
0000319839
-
Scheduling jobs within time windows on identical parallel machines: New model and algorithms
-
Gabrel V. Scheduling jobs within time windows on identical parallel machines: New model and algorithms. European Journal of Operational Research 83 (1995) 320-329
-
(1995)
European Journal of Operational Research
, vol.83
, pp. 320-329
-
-
Gabrel, V.1
-
44
-
-
0033877342
-
Maximum weight independent sets and cliques in intersection graphs of filaments
-
Gavril F. Maximum weight independent sets and cliques in intersection graphs of filaments. Information Processing Letters 73 (2000) 181-188
-
(2000)
Information Processing Letters
, vol.73
, pp. 181-188
-
-
Gavril, F.1
-
45
-
-
0017909297
-
Minimal resources for fixed and variable job schedules
-
Gertsbakh I., and Stern H.I. Minimal resources for fixed and variable job schedules. Operations Research 18 (1978) 68-95
-
(1978)
Operations Research
, vol.18
, pp. 68-95
-
-
Gertsbakh, I.1
Stern, H.I.2
-
49
-
-
51249185617
-
The ellipsoid method and its consequences in combinatorial optimization
-
Grötschel M., Lovász L., and Schrijver A. The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 1 (1981) 169-197
-
(1981)
Combinatorica
, vol.1
, pp. 169-197
-
-
Grötschel, M.1
Lovász, L.2
Schrijver, A.3
-
50
-
-
51249183588
-
Corrigendum to our paper, The ellipsoid method and its consequences in combinatorial optimization
-
Grötschel M., Lovász L., and Schrijver A. Corrigendum to our paper, The ellipsoid method and its consequences in combinatorial optimization. Combinatorica 4 (1984) 291-295
-
(1984)
Combinatorica
, vol.4
, pp. 291-295
-
-
Grötschel, M.1
Lovász, L.2
Schrijver, A.3
-
52
-
-
0043266314
-
A simple optimal algorithm for scheduling variable-sized requests
-
Harms J.J. A simple optimal algorithm for scheduling variable-sized requests. Information Processing Letters 68 (1998) 291-293
-
(1998)
Information Processing Letters
, vol.68
, pp. 291-293
-
-
Harms, J.J.1
-
53
-
-
85050951333
-
-
A. Hashimoto, J. Stevens, Wire routing by optimizing channel assignment with large apertures, in: Proceedings of the 8th Design Automation Conference, 1971, pp. 155-169.
-
-
-
-
54
-
-
0032095739
-
Minimizing the sum of job earliness and tardiness in a multi-machine system
-
Heady R.B., and Zhu Z. Minimizing the sum of job earliness and tardiness in a multi-machine system. International Journal of Production Research 36 (1998) 1619-1632
-
(1998)
International Journal of Production Research
, vol.36
, pp. 1619-1632
-
-
Heady, R.B.1
Zhu, Z.2
-
55
-
-
0036604762
-
Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs
-
Hiraishi K., Levner E., and Vlach M. Scheduling of parallel identical machines to maximize the weighted number of just-in-time jobs. Computers and Operations Research 29 (2002) 841-848
-
(2002)
Computers and Operations Research
, vol.29
, pp. 841-848
-
-
Hiraishi, K.1
Levner, E.2
Vlach, M.3
-
56
-
-
0027112854
-
An efficient algorithm for finding a maximum weight 2-independent set on interval graphs
-
Hsiao J.Y., Tang C.Y., and Chang R.S. An efficient algorithm for finding a maximum weight 2-independent set on interval graphs. Information Processing Letters 43 (1992) 229-235
-
(1992)
Information Processing Letters
, vol.43
, pp. 229-235
-
-
Hsiao, J.Y.1
Tang, C.Y.2
Chang, R.S.3
-
57
-
-
33750969223
-
-
W.L. Hsu, K.H. Tsai, A linear time algorithm for the two-track assignment problem, in: Proceedings of 27th Allerton Conference on Communication, Control and Computing, 1989, pp. 291-300.
-
-
-
-
58
-
-
0010834603
-
-
Johnson D.S., and Trick M.A. (Eds), American Mathematical Society, DIMACS
-
In: Johnson D.S., and Trick M.A. (Eds). Cliques Coloring and Satisfiability. DIMACS Series in Discrete Mathematics and Theoretical Computer Science vol. 26 (1996), American Mathematical Society, DIMACS
-
(1996)
DIMACS Series in Discrete Mathematics and Theoretical Computer Science
, vol.26
-
-
-
59
-
-
0242360519
-
On the complexity of scheduling tasks with discrete starting times
-
Keil J.M. On the complexity of scheduling tasks with discrete starting times. Operations Research Letters 12 (1992) 293-295
-
(1992)
Operations Research Letters
, vol.12
, pp. 293-295
-
-
Keil, J.M.1
-
60
-
-
0000564361
-
A polynomial algorithm in linear programming
-
Khachiyan L.G. A polynomial algorithm in linear programming. Dokladi Akademii Nauk SSSR 244 (1979) 1093-1096
-
(1979)
Dokladi Akademii Nauk SSSR
, vol.244
, pp. 1093-1096
-
-
Khachiyan, L.G.1
-
62
-
-
33750987785
-
-
A.J.W. Kolen, J.K. Lenstra, Combinatorics in operations research, in: R. Graham et al. (Eds.), Handbooks of Combinatorics, vol. II. 1995, pp. 1901-1904.
-
-
-
-
64
-
-
0031187695
-
Exact and approximation algorithms for the tactical fixed interval scheduling problem
-
Kroon L.G., Salomon M., and van Wassenhove L.N. Exact and approximation algorithms for the tactical fixed interval scheduling problem. Operations Research 45 (1997) 624-638
-
(1997)
Operations Research
, vol.45
, pp. 624-638
-
-
Kroon, L.G.1
Salomon, M.2
van Wassenhove, L.N.3
-
65
-
-
0038468534
-
A note on the maximum number of on-time jobs on parallel identical machines
-
Lann A., and Mosheiov G. A note on the maximum number of on-time jobs on parallel identical machines. Computers and Operations Research 30 (2003) 1745-1749
-
(2003)
Computers and Operations Research
, vol.30
, pp. 1745-1749
-
-
Lann, A.1
Mosheiov, G.2
-
67
-
-
33751001182
-
Maximum independent set of a permutation graph in K-tracks
-
Lee D.T., and Sarrafzadeh M. Maximum independent set of a permutation graph in K-tracks. Lecture Notes in Computer Science 557 (1991) 2-11
-
(1991)
Lecture Notes in Computer Science
, vol.557
, pp. 2-11
-
-
Lee, D.T.1
Sarrafzadeh, M.2
-
70
-
-
0027307594
-
-
D. Long, M. Thakur, Scheduling real-time disk transfers for continuous media applications, in: 12th IEEE Symposium on Mass Storage Systems, 1993, pp. 227-232.
-
-
-
-
71
-
-
84878638538
-
Genetic, iterated and multistart local search for the maximum clique problem
-
Marchiori E. Genetic, iterated and multistart local search for the maximum clique problem. Lecture Notes in Computer Science 2279 (2002) 112-121
-
(2002)
Lecture Notes in Computer Science
, vol.2279
, pp. 112-121
-
-
Marchiori, E.1
-
73
-
-
3042829826
-
An improved randomized on-line algorithm for a weighted interval selection problem
-
Miyazawa H., and Erlebach T. An improved randomized on-line algorithm for a weighted interval selection problem. Journal of Scheduling 7 (2004) 293-311
-
(2004)
Journal of Scheduling
, vol.7
, pp. 293-311
-
-
Miyazawa, H.1
Erlebach, T.2
-
74
-
-
0000230999
-
Maxima for graphs and a new proof of a theorem of Turán
-
Motzkin T.S., and Straus E.G. Maxima for graphs and a new proof of a theorem of Turán. Canadian Journal of Mathematics 17 (1965) 533-540
-
(1965)
Canadian Journal of Mathematics
, vol.17
, pp. 533-540
-
-
Motzkin, T.S.1
Straus, E.G.2
-
76
-
-
0016028005
-
Properties of vertex packings and independence system polyhedra
-
Nemhauser G.L., and Trotter L.E. Properties of vertex packings and independence system polyhedra. Mathematical Programming 6 (1974) 48-61
-
(1974)
Mathematical Programming
, vol.6
, pp. 48-61
-
-
Nemhauser, G.L.1
Trotter, L.E.2
-
77
-
-
34250404286
-
Vertex packings: Structural properties and algorithms
-
Nemhauser G.L., and Trotter L.E. Vertex packings: Structural properties and algorithms. Mathematical Programming 8 (1975) 232-248
-
(1975)
Mathematical Programming
, vol.8
, pp. 232-248
-
-
Nemhauser, G.L.1
Trotter, L.E.2
-
78
-
-
33751000066
-
-
C.T. Ng, M.Y. Kovalyov, T.C.E. Cheng, A graph-theoretic approach to interval scheduling on dedicated unrelated parallel machines, submitted for publication.
-
-
-
-
79
-
-
0029712085
-
A sequential algorithm for finding a maximum weight K-independent set on interval graphs
-
Pal M., and Bhattacharjee G.P. A sequential algorithm for finding a maximum weight K-independent set on interval graphs. International Journal of Computer Mathematics 60 (1996) 205-214
-
(1996)
International Journal of Computer Mathematics
, vol.60
, pp. 205-214
-
-
Pal, M.1
Bhattacharjee, G.P.2
-
80
-
-
0026897860
-
A branch and bound algorithm for the maximum clique problem
-
Pardalos P.M., and Rodgers G.P. A branch and bound algorithm for the maximum clique problem. Computers and Operations Research 19 (1992) 363-375
-
(1992)
Computers and Operations Research
, vol.19
, pp. 363-375
-
-
Pardalos, P.M.1
Rodgers, G.P.2
-
81
-
-
30244506467
-
A primal-dual interior point method whose running time depends only on the constraint matrix
-
Vavasis S.A., and Ye Y. A primal-dual interior point method whose running time depends only on the constraint matrix. Mathematical Programming 74 (1996) 79-120
-
(1996)
Mathematical Programming
, vol.74
, pp. 79-120
-
-
Vavasis, S.A.1
Ye, Y.2
-
82
-
-
28344439796
-
Maximum weight k-independent set problem on permutation graphs
-
Saha A., and Pal M. Maximum weight k-independent set problem on permutation graphs. International Journal of Computer Mathematics 80 (2003) 1477-1487
-
(2003)
International Journal of Computer Mathematics
, vol.80
, pp. 1477-1487
-
-
Saha, A.1
Pal, M.2
-
83
-
-
0027146770
-
Maximum k-covering of weighted transitive graphs with applications
-
Sarrafzadeh M., and Lou R.D. Maximum k-covering of weighted transitive graphs with applications. Algorithmica 9 (1993) 84-100
-
(1993)
Algorithmica
, vol.9
, pp. 84-100
-
-
Sarrafzadeh, M.1
Lou, R.D.2
-
84
-
-
0022736228
-
Polyhedral proof methods in combinatorial optimization
-
Schrijver A. Polyhedral proof methods in combinatorial optimization. Discrete Applied Mathematics 14 (1986) 111-133
-
(1986)
Discrete Applied Mathematics
, vol.14
, pp. 111-133
-
-
Schrijver, A.1
-
85
-
-
0032058271
-
Randomized online interval scheduling
-
Seiden S.S. Randomized online interval scheduling. Operations Research Letters 220 (1998) 171-177
-
(1998)
Operations Research Letters
, vol.220
, pp. 171-177
-
-
Seiden, S.S.1
-
86
-
-
6944244346
-
Real time scheduling theory: A historical perspective
-
Sha L., Abdelzaher T., Arzen K.-E., Cervin A., Baker T., Burns A., Buttazzo G., Caccamo M., Lehoczky J., and Mok A.K. Real time scheduling theory: A historical perspective. Real-Time Systems 28 (2004) 101-155
-
(2004)
Real-Time Systems
, vol.28
, pp. 101-155
-
-
Sha, L.1
Abdelzaher, T.2
Arzen, K.-E.3
Cervin, A.4
Baker, T.5
Burns, A.6
Buttazzo, G.7
Caccamo, M.8
Lehoczky, J.9
Mok, A.K.10
-
87
-
-
0004835364
-
Convergence rate of the gradient descent method with dilatation of the space
-
Shor N.Z. Convergence rate of the gradient descent method with dilatation of the space. Kibernetika 2 (1970) 80-85
-
(1970)
Kibernetika
, vol.2
, pp. 80-85
-
-
Shor, N.Z.1
-
88
-
-
0000834224
-
-
N.Z. Shor, Dual quadratic estimates in polynomial and Boolean programming, in: P.M. Pardalos, J.B. Rosen (Eds.), Computational Methods of Global Optimization, Annals of Operations Research, vol. 25, 1990, pp. 163-168.
-
-
-
-
89
-
-
0022012946
-
Amortized efficiency of list update and paging rules
-
Sleator D., and Tarjan R. Amortized efficiency of list update and paging rules. Communications ACM 28 (1970) 202-208
-
(1970)
Communications ACM
, vol.28
, pp. 202-208
-
-
Sleator, D.1
Tarjan, R.2
-
91
-
-
0000321137
-
On the approximability of an interval scheduling problem
-
Spieksma F.C.R. On the approximability of an interval scheduling problem. Journal of Scheduling 2 (1999) 215-227
-
(1999)
Journal of Scheduling
, vol.2
, pp. 215-227
-
-
Spieksma, F.C.R.1
-
92
-
-
0000094273
-
A unified analysis of paging and caching
-
Torng E. A unified analysis of paging and caching. Algorithmica 20 (1998) 175-200
-
(1998)
Algorithmica
, vol.20
, pp. 175-200
-
-
Torng, E.1
-
94
-
-
21244468469
-
The relation of time indexed formulations of single machine scheduling problems to the node packing problem
-
Waterer H., Johnson E.L., Nobili P., and Savelsbergh M.W.P. The relation of time indexed formulations of single machine scheduling problems to the node packing problem. Mathematical Programming Series A 93 (2002) 477-494
-
(2002)
Mathematical Programming Series A
, vol.93
, pp. 477-494
-
-
Waterer, H.1
Johnson, E.L.2
Nobili, P.3
Savelsbergh, M.W.P.4
-
95
-
-
0028485488
-
On-line scheduling of jobs with fixed start and end times
-
Woeginger G.J. On-line scheduling of jobs with fixed start and end times. Theoretical Computer Science 130 (1994) 5-16
-
(1994)
Theoretical Computer Science
, vol.130
, pp. 5-16
-
-
Woeginger, G.J.1
-
96
-
-
0023123188
-
The maximum k-colorable subgraph problem for chordal graphs
-
Yannakakis M., and Gavril F. The maximum k-colorable subgraph problem for chordal graphs. Information Processing Letters 24 (1987) 133-137
-
(1987)
Information Processing Letters
, vol.24
, pp. 133-137
-
-
Yannakakis, M.1
Gavril, F.2
|