×

zbMATH — the first resource for mathematics

Lawler, Eugene L.

Compute Distance To:
Author ID: lawler.eugene-l Recent zbMATH articles by "Lawler, Eugene L."
Published as: Lawler, E.; Lawler, E. L; Lawler, E. L.; Lawler, Eugene; Lawler, Eugene L.
External Links: MGP · Wikidata · dblp · GND
Documents Indexed: 94 Publications since 1962, including 15 Books
Biographic References: 4 Publications

Publications by Year

Citations contained in zbMATH Open

83 Publications have been cited 4,831 times in 3,899 Documents Cited by Year
Optimization and approximation in deterministic sequencing and scheduling: A survey. Zbl 0411.90044
Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
1979
Combinatorial optimization: Networks and matroids. Zbl 0413.90040
Lawler, Eugene L.
710
1976
Graphical algorithms and their complexity. Zbl 0358.68059
Lawler, E. L.
254
1976
The traveling salesman problem. A guided tour of combinatorial optimization. Reprint. Zbl 0562.00014
Lawler, E. L. (ed.); Lenstra, J. K. (ed.); Rinnooy Kan, A. H. G. (ed.); Shmoys, D. B. (ed.)
216
1985
The recognition of series parallel digraphs. Zbl 0478.68065
Valdes, Jacobo; Tarjan, Robert E.; Lawler, Eugene L.
191
1982
The traveling salesman problem. Bibliography. Zbl 0563.90075
Lawler, E. L. (ed.); Lenstra, J. K. (ed.); Rinnooy Kan, A. H. G. (ed.); Shmoys, D. B. (ed.)
176
1985
The quadratic assignment problem. Zbl 0995.90579
Lawler, Eugene L.
144
1963
A ”pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Zbl 0353.68071
Lawler, Eugene L.
143
1977
Branch-and-bound methods. A survey. Zbl 0143.42501
Lawler, E. L.; Wood, D. E.
121
1966
A functional equation and its application to resource allocation and sequencing problems. Zbl 0184.23303
Lawler, E. L.; Moore, J. M.
119
1969
Optimal sequencing of a single machine subjec t to precedence constraints. Zbl 0254.90039
Lawler, E. L.
117
1973
Recent developments in deterministic sequencing and scheduling: A survey. Zbl 0482.68035
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
91
1982
Fast approximation algorithms for knapsack problems. Zbl 0425.90064
Lawler, Eugene L.
85
1979
Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Zbl 0374.68033
Lawler, E. L.
85
1978
Well-solved special cases. Zbl 0631.90081
Gilmore, P. C.; Lawler, E. L.; Shmoys, D. B.
69
1985
On preemptive scheduling of unrelated parallel processors by linear programming. Zbl 0388.68027
Lawler, E. L.; Labetoulle, J.
68
1978
Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. Zbl 0445.68054
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
66
1980
A procedure for computing the \(K\) best solutions to discrete optimization problems and its application to the shortest path problem. Zbl 0234.90050
Lawler, Eugene L.
65
1972
Linear-time computation of optimal subgraphs of decomposable graphs. Zbl 0618.68058
Bern, M. W.; Lawler, E. L.; Wong, A. L.
55
1987
Combinatorial optimization. Networks and matroids. Repr. Zbl 1058.90057
Lawler, Eugene
50
2001
Preemptive scheduling of uniform machines subject to release dates. Zbl 0554.90059
Labetoulle, J.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
49
1984
A note on the complexity of the chromatic number problem. Zbl 0336.68021
Lawler, E. L.
45
1976
Matroid intersection algorithms. Zbl 0315.90039
Lawler, Eugene L.
37
1975
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Zbl 0709.90064
Lawler, E. L
31
1990
Recent results in the theory of machine scheduling. Zbl 0547.90042
Lawler, E. L.
27
1983
Minimizing maximum lateness in a two-machine open shop. Zbl 0496.90047
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
27
1981
Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Zbl 0442.90040
Baker, K. R.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
27
1980
Computing maximal ”polymatroidal” network flows. Zbl 0498.90029
Lawler, E. L.; Martel, C. U.
26
1982
Efficient implementation of dynamic programming algorithms for sequencing problems. Zbl 0416.90036
Lawler, E. L.
25
1979
A fully polynomial approximation scheme for the total tardiness problem. Zbl 0511.90074
Lawler, E. L.
23
1982
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘Tower of Sets’ property. Zbl 0810.90070
Lawler, E. L.
22
1994
Sublinear approximate string matching and biological applications. Zbl 0942.68575
Chang, W. I.; Lawler, E. L.
22
1994
Computer aided complexity classification of deterministic scheduling problems. Zbl 0452.90035
Lageweg, B. J.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
20
1981
Sequencing to minimize the weighted number of tardy jobs. Zbl 0333.68044
Lawler, E. L.
20
1976
Preemptive scheduling of precedence-constrained jobs on parallel machines. Zbl 0495.68031
Lawler, E. L.
17
1982
Recent developments in deterministic sequencing and scheduling: A survey. Zbl 0474.68056
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
16
1981
Some aspects of duality in combinatorial optimization. Zbl 0362.90076
Lawler, E. L.
14
1975
Cutsets and partitions of hypergraphs. Zbl 0262.05126
Lawler, E. L.
14
1973
Approximation algorithms for tree alignment with a given phylogeny. Zbl 0862.68119
Wang, Lusheng; Jiang, Tao; Lawler, E. L.
13
1996
Solving the weighted parity problem for gammoids by reduction to graphic matching. Zbl 0566.05017
Tong, Po; Lawler, E. L.; Vazirani, V. V.
13
1984
Preemptive scheduling of two uniform machines to minimizing the number of late jobs. Zbl 0672.90071
Lawler, E. L.; Martel, C. U.
12
1989
Determining the evolutionary tree using experiments. Zbl 0857.68082
Kannan, Sampath K.; Lawler, Eugene L.; Warnow, Tandy J.
11
1996
Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász. Zbl 0661.05026
Chang, W. I.; Lawler, E. L.
11
1988
Computer-aided complexity classification of combinatorial problems. Zbl 0491.68070
Lageweg, B. J.; Lenstra, J. K.; Lawler, E. L.; Rinnooy Kan, A. H. G.
11
1982
Shortest path and network flow algorithms. Zbl 0453.90099
Lawler, Eugene L.
11
1979
Approximation algorithms for multiple sequence alignment. Zbl 0911.68070
Bafna, Vineet; Lawler, Eugene L.; Pevzner, Pavel A.
10
1997
Scheduling periodically occurring tasks on multiple processors. Zbl 0454.68018
Lawler, Eugene L.; Martel, Charles U.
10
1981
Optimization and approximation in deterministic sequencing and scheduling: A survey. Zbl 0388.90032
Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
10
1978
Minimization of time-varying costs in single-machine scheduling. Zbl 0385.90055
Lawler, E. L.; Sivazlian, B. D.
10
1978
Scheduling open shops with parallel machines. Zbl 0489.90053
Lawler, E. L.; Luby, M. G.; Vazirani, V. V.
9
1982
Fast approximation algorithms for knapsack problems. Zbl 0389.90071
Lawler, E. L.
9
1978
Optimal cycles in doubly weighted directed linear graphs. Zbl 0196.56301
Lawler, E. L.
9
1967
Aligning sequences via an evolutionary tree: complexity and approximation. Zbl 1345.92106
Jiang, Tao; Lawler, Eugene L.; Wang, Lusheng
8
1994
The quadratic assignment problem: A brief review. Zbl 0306.90057
Lawler, E. L.
7
1975
Optimal sequencing of jobs subject to series parallel precedence constraints. Zbl 0332.90023
Lawler, E. L.
5
1975
Module clustering to minimize delay in digital networks. Zbl 0172.20603
Lawler, E. L.; Levitt, K. N.; Turner, James
5
1969
Covering problems. Duality relations and a new method of solution. Zbl 0143.42402
Lawler, E. L.
5
1966
An algorithm for “Ulam’s Game” and its application to error correcting codes. Zbl 0875.94119
Lawler, Eugene L.; Sarkissian, Sergei
4
1995
Determining the evolutionary tree. Zbl 0800.68618
Kannan, Sampath; Lawler, Eugene; Warnow, Tandy
4
1990
Flow network formulations of polymatroid optimization problems. Zbl 0504.90018
Lawler, E. L.; Martel, C. U.
4
1982
Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs. Zbl 0416.90035
Lawler, E. L.
4
1979
A solvable case of the traveling salesman problem. Zbl 0242.90036
Lawler, Eugene L.
4
1971
Optimal matroid intersections. Zbl 0256.05014
Lawler, Eugene L.
4
1970
Submodular functions and polymatroid optimization. Zbl 0563.90073
Lawler, E. L.
3
1985
Erratum to “Minimizing maximum lateness in a two-machine open shop”. Zbl 0497.90036
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
3
1982
An introduction to matroid optimization. Zbl 0359.90055
Lawler, E. L.
3
1975
Optimal preemptive scheduling of two unrelated processors. Zbl 0755.90042
Gonzales, Teofilo; Lawler, Eugene L.; Sahni, Sartaj
2
1990
A linear time algorithm for finding an optimal dominating subforest of a tree. Zbl 0596.05058
Lawler, E. L.; Slater, P. J.
2
1985
Finding shortest paths in very large networks. Zbl 0552.90089
Lawler, E. L.; Luby, M. G.; Parker, B.
2
1983
A faster algorithm for finding edge-disjoint branchings. Zbl 0509.68060
Tong, Po; Lawler, E. L.
2
1983
Machine scheduling with precedence constraints. Zbl 0474.68057
Lawler, E. L.; Lenstra, J. K.
2
1981
A matroid generalization of a theorem of Mendelsohn and Dulmage. Zbl 0249.05017
Kundu, Sukhamay; Lawler, Eugene L.
2
1973
Optimal cycles in graphs and the minimal cost-to-time ratio problem. Zbl 0296.90047
Lawler, Eugene L.
2
1972
The complexity of combinatorial computations. A survey. Zbl 0257.68035
Lawler, E. L.
2
1971
An approach to multilevel Boolean minimization. Zbl 0126.32801
Lawler, E.
2
1964
Computing shortest paths in networks derived from recurrence relations. Zbl 0736.90074
Lawler, E. L.
1
1991
Machine scheduling with precedence constraints. Zbl 0489.90054
Lawler, E. L.; Lenstra, J. K.
1
1982
The great mathematical sputnik of 1979. Zbl 0482.90061
Lawler, Eugene L.
1
1982
Computer aided complexity classification of combinatorial problems. Zbl 0452.90034
Lageweg, B. J.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
1
1981
The great mathematical sputnik of 1979. Zbl 0444.90055
Lawler, Eugene L.
1
1980
Minimizing maximum lateness in a two-machine open shop. Zbl 0416.90037
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
1
1979
Comment on computing the k shortest paths in a graph. Zbl 0352.68057
Lawler, Eugene L.
1
1977
Electrical assemblies with a minimum number of interconnections. Zbl 0127.08702
Lawler, E. L.
1
1962
Combinatorial optimization. Networks and matroids. Repr. Zbl 1058.90057
Lawler, Eugene
50
2001
Approximation algorithms for multiple sequence alignment. Zbl 0911.68070
Bafna, Vineet; Lawler, Eugene L.; Pevzner, Pavel A.
10
1997
Approximation algorithms for tree alignment with a given phylogeny. Zbl 0862.68119
Wang, Lusheng; Jiang, Tao; Lawler, E. L.
13
1996
Determining the evolutionary tree using experiments. Zbl 0857.68082
Kannan, Sampath K.; Lawler, Eugene L.; Warnow, Tandy J.
11
1996
An algorithm for “Ulam’s Game” and its application to error correcting codes. Zbl 0875.94119
Lawler, Eugene L.; Sarkissian, Sergei
4
1995
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘Tower of Sets’ property. Zbl 0810.90070
Lawler, E. L.
22
1994
Sublinear approximate string matching and biological applications. Zbl 0942.68575
Chang, W. I.; Lawler, E. L.
22
1994
Aligning sequences via an evolutionary tree: complexity and approximation. Zbl 1345.92106
Jiang, Tao; Lawler, Eugene L.; Wang, Lusheng
8
1994
Computing shortest paths in networks derived from recurrence relations. Zbl 0736.90074
Lawler, E. L.
1
1991
A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Zbl 0709.90064
Lawler, E. L
31
1990
Determining the evolutionary tree. Zbl 0800.68618
Kannan, Sampath; Lawler, Eugene; Warnow, Tandy
4
1990
Optimal preemptive scheduling of two unrelated processors. Zbl 0755.90042
Gonzales, Teofilo; Lawler, Eugene L.; Sahni, Sartaj
2
1990
Preemptive scheduling of two uniform machines to minimizing the number of late jobs. Zbl 0672.90071
Lawler, E. L.; Martel, C. U.
12
1989
Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász. Zbl 0661.05026
Chang, W. I.; Lawler, E. L.
11
1988
Linear-time computation of optimal subgraphs of decomposable graphs. Zbl 0618.68058
Bern, M. W.; Lawler, E. L.; Wong, A. L.
55
1987
The traveling salesman problem. A guided tour of combinatorial optimization. Reprint. Zbl 0562.00014
Lawler, E. L. (ed.); Lenstra, J. K. (ed.); Rinnooy Kan, A. H. G. (ed.); Shmoys, D. B. (ed.)
216
1985
The traveling salesman problem. Bibliography. Zbl 0563.90075
Lawler, E. L. (ed.); Lenstra, J. K. (ed.); Rinnooy Kan, A. H. G. (ed.); Shmoys, D. B. (ed.)
176
1985
Well-solved special cases. Zbl 0631.90081
Gilmore, P. C.; Lawler, E. L.; Shmoys, D. B.
69
1985
Submodular functions and polymatroid optimization. Zbl 0563.90073
Lawler, E. L.
3
1985
A linear time algorithm for finding an optimal dominating subforest of a tree. Zbl 0596.05058
Lawler, E. L.; Slater, P. J.
2
1985
Preemptive scheduling of uniform machines subject to release dates. Zbl 0554.90059
Labetoulle, J.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
49
1984
Solving the weighted parity problem for gammoids by reduction to graphic matching. Zbl 0566.05017
Tong, Po; Lawler, E. L.; Vazirani, V. V.
13
1984
Recent results in the theory of machine scheduling. Zbl 0547.90042
Lawler, E. L.
27
1983
Finding shortest paths in very large networks. Zbl 0552.90089
Lawler, E. L.; Luby, M. G.; Parker, B.
2
1983
A faster algorithm for finding edge-disjoint branchings. Zbl 0509.68060
Tong, Po; Lawler, E. L.
2
1983
The recognition of series parallel digraphs. Zbl 0478.68065
Valdes, Jacobo; Tarjan, Robert E.; Lawler, Eugene L.
191
1982
Recent developments in deterministic sequencing and scheduling: A survey. Zbl 0482.68035
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
91
1982
Computing maximal ”polymatroidal” network flows. Zbl 0498.90029
Lawler, E. L.; Martel, C. U.
26
1982
A fully polynomial approximation scheme for the total tardiness problem. Zbl 0511.90074
Lawler, E. L.
23
1982
Preemptive scheduling of precedence-constrained jobs on parallel machines. Zbl 0495.68031
Lawler, E. L.
17
1982
Computer-aided complexity classification of combinatorial problems. Zbl 0491.68070
Lageweg, B. J.; Lenstra, J. K.; Lawler, E. L.; Rinnooy Kan, A. H. G.
11
1982
Scheduling open shops with parallel machines. Zbl 0489.90053
Lawler, E. L.; Luby, M. G.; Vazirani, V. V.
9
1982
Flow network formulations of polymatroid optimization problems. Zbl 0504.90018
Lawler, E. L.; Martel, C. U.
4
1982
Erratum to “Minimizing maximum lateness in a two-machine open shop”. Zbl 0497.90036
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
3
1982
Machine scheduling with precedence constraints. Zbl 0489.90054
Lawler, E. L.; Lenstra, J. K.
1
1982
The great mathematical sputnik of 1979. Zbl 0482.90061
Lawler, Eugene L.
1
1982
Minimizing maximum lateness in a two-machine open shop. Zbl 0496.90047
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
27
1981
Computer aided complexity classification of deterministic scheduling problems. Zbl 0452.90035
Lageweg, B. J.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
20
1981
Recent developments in deterministic sequencing and scheduling: A survey. Zbl 0474.68056
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
16
1981
Scheduling periodically occurring tasks on multiple processors. Zbl 0454.68018
Lawler, Eugene L.; Martel, Charles U.
10
1981
Machine scheduling with precedence constraints. Zbl 0474.68057
Lawler, E. L.; Lenstra, J. K.
2
1981
Computer aided complexity classification of combinatorial problems. Zbl 0452.90034
Lageweg, B. J.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
1
1981
Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. Zbl 0445.68054
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
66
1980
Preemptive scheduling of a single machine to minimize maximum cost subject to release dates and precedence constraints. Zbl 0442.90040
Baker, K. R.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
27
1980
The great mathematical sputnik of 1979. Zbl 0444.90055
Lawler, Eugene L.
1
1980
Optimization and approximation in deterministic sequencing and scheduling: A survey. Zbl 0411.90044
Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
1979
Fast approximation algorithms for knapsack problems. Zbl 0425.90064
Lawler, Eugene L.
85
1979
Efficient implementation of dynamic programming algorithms for sequencing problems. Zbl 0416.90036
Lawler, E. L.
25
1979
Shortest path and network flow algorithms. Zbl 0453.90099
Lawler, Eugene L.
11
1979
Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs. Zbl 0416.90035
Lawler, E. L.
4
1979
Minimizing maximum lateness in a two-machine open shop. Zbl 0416.90037
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
1
1979
Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Zbl 0374.68033
Lawler, E. L.
85
1978
On preemptive scheduling of unrelated parallel processors by linear programming. Zbl 0388.68027
Lawler, E. L.; Labetoulle, J.
68
1978
Optimization and approximation in deterministic sequencing and scheduling: A survey. Zbl 0388.90032
Graham, R. L.; Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
10
1978
Minimization of time-varying costs in single-machine scheduling. Zbl 0385.90055
Lawler, E. L.; Sivazlian, B. D.
10
1978
Fast approximation algorithms for knapsack problems. Zbl 0389.90071
Lawler, E. L.
9
1978
A ”pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Zbl 0353.68071
Lawler, Eugene L.
143
1977
Comment on computing the k shortest paths in a graph. Zbl 0352.68057
Lawler, Eugene L.
1
1977
Combinatorial optimization: Networks and matroids. Zbl 0413.90040
Lawler, Eugene L.
710
1976
Graphical algorithms and their complexity. Zbl 0358.68059
Lawler, E. L.
254
1976
A note on the complexity of the chromatic number problem. Zbl 0336.68021
Lawler, E. L.
45
1976
Sequencing to minimize the weighted number of tardy jobs. Zbl 0333.68044
Lawler, E. L.
20
1976
Matroid intersection algorithms. Zbl 0315.90039
Lawler, Eugene L.
37
1975
Some aspects of duality in combinatorial optimization. Zbl 0362.90076
Lawler, E. L.
14
1975
The quadratic assignment problem: A brief review. Zbl 0306.90057
Lawler, E. L.
7
1975
Optimal sequencing of jobs subject to series parallel precedence constraints. Zbl 0332.90023
Lawler, E. L.
5
1975
An introduction to matroid optimization. Zbl 0359.90055
Lawler, E. L.
3
1975
Optimal sequencing of a single machine subjec t to precedence constraints. Zbl 0254.90039
Lawler, E. L.
117
1973
Cutsets and partitions of hypergraphs. Zbl 0262.05126
Lawler, E. L.
14
1973
A matroid generalization of a theorem of Mendelsohn and Dulmage. Zbl 0249.05017
Kundu, Sukhamay; Lawler, Eugene L.
2
1973
A procedure for computing the \(K\) best solutions to discrete optimization problems and its application to the shortest path problem. Zbl 0234.90050
Lawler, Eugene L.
65
1972
Optimal cycles in graphs and the minimal cost-to-time ratio problem. Zbl 0296.90047
Lawler, Eugene L.
2
1972
A solvable case of the traveling salesman problem. Zbl 0242.90036
Lawler, Eugene L.
4
1971
The complexity of combinatorial computations. A survey. Zbl 0257.68035
Lawler, E. L.
2
1971
Optimal matroid intersections. Zbl 0256.05014
Lawler, Eugene L.
4
1970
A functional equation and its application to resource allocation and sequencing problems. Zbl 0184.23303
Lawler, E. L.; Moore, J. M.
119
1969
Module clustering to minimize delay in digital networks. Zbl 0172.20603
Lawler, E. L.; Levitt, K. N.; Turner, James
5
1969
Optimal cycles in doubly weighted directed linear graphs. Zbl 0196.56301
Lawler, E. L.
9
1967
Branch-and-bound methods. A survey. Zbl 0143.42501
Lawler, E. L.; Wood, D. E.
121
1966
Covering problems. Duality relations and a new method of solution. Zbl 0143.42402
Lawler, E. L.
5
1966
An approach to multilevel Boolean minimization. Zbl 0126.32801
Lawler, E.
2
1964
The quadratic assignment problem. Zbl 0995.90579
Lawler, Eugene L.
144
1963
Electrical assemblies with a minimum number of interconnections. Zbl 0127.08702
Lawler, E. L.
1
1962
all top 5

Cited by 4,895 Authors

67 Cheng, Tai-Chiu Edwin
61 Yuan, Jinjiang
51 Wang, Jibo
39 Pardalos, Panos M.
34 Leung, Joseph Y.-T.
33 Woeginger, Gerhard Johannes
30 Shabtay, Dvir
30 Werner, Frank
29 Błażewicz, Jacek
29 Steiner, George
27 Strusevich, Vitaly A.
25 Kovalyov, Mikhail Yakovlevich
22 Punnen, Abraham P.
21 Ng, Chi To
21 Pei, Jun
20 Liu, Xinbao
20 Pinedo, Michael L.
20 Potts, Chris N.
19 Burkard, Rainer E.
19 Della Croce, Federico
18 Sriskandarajah, Chelliah
17 He, Cheng
17 T’kindt, Vincent
17 Yang, Dar-Li
16 Ibaraki, Toshihide
16 Lazarev, Aleksander Alekseevich
16 Liu, Yanpei
15 Brucker, Peter J.
15 Hoogeveen, Johannes Adzer
15 Jansen, Klaus
15 Kasperski, Adam
15 Lenstra, Jan Karel
15 Maffioli, Francesco
15 Toth, Paolo
15 Yin, Yunqiang
14 Bampis, Evripidis
14 Framinan, Jose M.
14 Hochbaum, Dorit S.
14 Ji, Ping
14 Pesch, Erwin
14 Ruiz, Rubén
14 Yang, Shanlin
13 Boros, Endre
13 Giroudeau, Rodolphe
13 Gordon, Valery S.
13 Hurink, Johann L.
13 Janiak, Adam
13 Kis, Tamás
13 Kubiak, Wiesław X.
13 Lin, Bertrand Miao-Tsong
13 Orlin, James B.
13 Rinnooy Kan, Alexander Hendrik George
12 Baptiste, Philippe
12 Camerini, Paolo M.
12 de Werra, Dominique
12 Deĭneko, Vladimir G.
12 Elbassioni, Khaled M.
12 Hamacher, Horst W.
12 Huang, Xue
12 Huo, Yumei
12 Ji, Min
12 Koulamas, Christos P.
12 Krumke, Sven Oliver
12 Lu, Lingfa
12 Queyranne, Maurice
12 Shakhlevich, Natalia V.
12 Sotskov, Yuri N.
11 Gouveia, Luis
11 Gurvich, Vladimir A.
11 Hassin, Refael
11 Jacobson, Sheldon H.
11 König, Jean-Claude
11 Kuo, Wen-Hung
11 Lee, Kangbok
11 Li, Shisheng
11 Nagamochi, Hiroshi
11 Wang, Jianjun
11 Wang, Mingzheng
11 Xu, Dehua
11 Zieliński, Paweł
10 Billaut, Jean-Charles
10 Bodlaender, Hans L.
10 Choi, Byung-Cheon
10 Chu, Chengbin
10 Drozdowski, Maciej
10 Fujishige, Satoru
10 Kellerer, Johann
10 Laporte, Gilbert
10 Lee, Richard Chia-Tung
10 Makino, Kazuhisa
10 Martello, Silvano
10 Monch, Lars
10 Rudek, Radosław
10 Tang, Guochun
10 Uetz, Marc
9 Alidaee, Bahram
9 Boysen, Nils
9 Briskorn, Dirk
9 Dell’Amico, Mauro
9 Fan, Wenjuan
...and 4,795 more Authors
all top 5

Cited in 277 Serials

601 European Journal of Operational Research
334 Discrete Applied Mathematics
330 Computers & Operations Research
196 Theoretical Computer Science
174 Operations Research Letters
153 Journal of Scheduling
123 Information Processing Letters
109 Annals of Operations Research
91 Mathematical Programming. Series A. Series B
81 Algorithmica
68 Networks
60 Journal of Combinatorial Optimization
56 Applied Mathematical Modelling
55 Discrete Mathematics
41 Optimization Letters
38 Mathematical Programming
38 Asia-Pacific Journal of Operational Research
34 Discrete Optimization
33 Mathematical and Computer Modelling
30 Applied Mathematics and Computation
30 International Journal of Production Research
28 Mathematical Problems in Engineering
26 RAIRO. Operations Research
25 Information Sciences
24 Artificial Intelligence
23 Journal of Computer and System Sciences
21 Computers & Mathematics with Applications
20 Computational Optimization and Applications
19 Optimization
19 Journal of Global Optimization
19 Linear Algebra and its Applications
18 Computing
18 Naval Research Logistics
18 Automation and Remote Control
17 Information and Computation
16 International Journal of Systems Science
16 Journal of Combinatorial Theory. Series B
15 Journal of Optimization Theory and Applications
15 International Journal of Foundations of Computer Science
15 4OR
14 Journal of Discrete Algorithms
13 Theory of Computing Systems
13 Journal of Industrial and Management Optimization
12 SIAM Journal on Algebraic and Discrete Methods
12 Order
12 Japan Journal of Industrial and Applied Mathematics
12 Journal of Heuristics
12 Journal of the Operations Research Society of China
11 International Journal of Computer Mathematics
11 ZOR. Zeitschrift für Operations Research
11 CEJOR. Central European Journal of Operations Research
11 Journal of Applied Mathematics and Computing
11 Algorithms
10 SIAM Journal on Computing
10 Combinatorica
10 Applied Mathematics Letters
10 Zeitschrift für Operations Research. Serie A: Theorie
10 Applied Mathematics. Series B (English Edition)
10 OR Spectrum
9 European Journal of Combinatorics
9 SIAM Journal on Discrete Mathematics
9 International Transactions in Operational Research
9 Mathematical Methods of Operations Research
8 Journal of Computational and Applied Mathematics
8 Opsearch
8 INFORMS Journal on Computing
8 Journal of Applied Mathematics
7 Acta Informatica
7 Fuzzy Sets and Systems
7 Journal of Soviet Mathematics
7 Journal of Information & Optimization Sciences
7 Discrete Dynamics in Nature and Society
6 Automatica
6 BIT
6 Journal of Combinatorial Theory. Series A
6 Mathematics of Operations Research
6 Probability in the Engineering and Informational Sciences
6 Proceedings of the Steklov Institute of Mathematics
6 Mathematical Programming Computation
6 International Journal of Systems Science. Principles and Applications of Systems and Integration
5 Statistica Neerlandica
5 OR Spektrum
5 Acta Mathematicae Applicatae Sinica. English Series
5 International Journal of Approximate Reasoning
5 Computational Geometry
5 Constraints
5 Optimization Methods & Software
5 Optimization and Engineering
4 Journal of Mathematical Analysis and Applications
4 Calcolo
4 International Journal of Computer & Information Sciences
4 Journal of Graph Theory
4 Cybernetics
4 Mathematical Social Sciences
4 Discrete & Computational Geometry
4 Journal of Parallel and Distributed Computing
4 Cybernetics and Systems Analysis
4 Computational and Applied Mathematics
4 Top
4 Annals of Mathematics and Artificial Intelligence
...and 177 more Serials
all top 5

Cited in 44 Fields

2,999 Operations research, mathematical programming (90-XX)
1,296 Computer science (68-XX)
664 Combinatorics (05-XX)
185 Numerical analysis (65-XX)
94 Game theory, economics, finance, and other social and behavioral sciences (91-XX)
65 Order, lattices, ordered algebraic structures (06-XX)
62 Convex and discrete geometry (52-XX)
61 Biology and other natural sciences (92-XX)
55 Information and communication theory, circuits (94-XX)
42 Systems theory; control (93-XX)
28 Linear and multilinear algebra; matrix theory (15-XX)
28 Statistics (62-XX)
26 Mathematical logic and foundations (03-XX)
21 Calculus of variations and optimal control; optimization (49-XX)
21 Probability theory and stochastic processes (60-XX)
9 Group theory and generalizations (20-XX)
6 Geometry (51-XX)
6 Statistical mechanics, structure of matter (82-XX)
5 History and biography (01-XX)
5 Measure and integration (28-XX)
5 Quantum theory (81-XX)
4 General algebraic systems (08-XX)
4 Number theory (11-XX)
4 Associative rings and algebras (16-XX)
3 Category theory; homological algebra (18-XX)
3 Functions of a complex variable (30-XX)
3 Approximations and expansions (41-XX)
3 Operator theory (47-XX)
3 Mechanics of particles and systems (70-XX)
3 Mechanics of deformable solids (74-XX)
3 Fluid mechanics (76-XX)
2 General and overarching topics; collections (00-XX)
2 Field theory and polynomials (12-XX)
2 Algebraic geometry (14-XX)
2 Differential geometry (53-XX)
2 General topology (54-XX)
2 Manifolds and cell complexes (57-XX)
1 Commutative algebra (13-XX)
1 Topological groups, Lie groups (22-XX)
1 Real functions (26-XX)
1 Ordinary differential equations (34-XX)
1 Dynamical systems and ergodic theory (37-XX)
1 Integral transforms, operational calculus (44-XX)
1 Classical thermodynamics, heat transfer (80-XX)

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.