×

Lawler, Eugene Leighton (b. 1933 d. 1994)

Author ID: lawler.eugene-l Recent zbMATH articles by "Lawler, Eugene Leighton"
Published as: Lawler, E. L.; Lawler, Eugene L.; Lawler, Eugene; Lawler, E. L; Lawler, E.
External Links: MGP · Wikidata · dblp · GND · IdRef

Publications by Year

Citations contained in zbMATH Open

85 Publications have been cited 5,619 times in 4,817 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.
551
1976
The traveling salesman problem. A guided tour of combinatorial optimization. Reprint. Zbl 0562.00014
318
1985
Graphical algorithms and their complexity. Zbl 0358.68059
Lawler, E. L.
257
1976
The recognition of series parallel digraphs. Zbl 0478.68065
Valdes, Jacobo; Tarjan, Robert E.; Lawler, Eugene L.
229
1982
The traveling salesman problem. Bibliography. Zbl 0563.90075
175
1985
A ”pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Zbl 0353.68071
Lawler, Eugene L.
174
1977
The quadratic assignment problem. Zbl 0995.90579
Lawler, Eugene L.
165
1963
Branch-and-bound methods. A survey. Zbl 0143.42501
Lawler, E. L.; Wood, D. E.
160
1966
Optimal sequencing of a single machine subjec t to precedence constraints. Zbl 0254.90039
Lawler, E. L.
144
1973
A functional equation and its application to resource allocation and sequencing problems. Zbl 0184.23303
Lawler, E. L.; Moore, J. M.
142
1969
Fast approximation algorithms for knapsack problems. Zbl 0425.90064
Lawler, Eugene L.
106
1979
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.
99
1980
Sequencing jobs to minimize total weighted completion time subject to precedence constraints. Zbl 0374.68033
Lawler, E. L.
98
1978
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
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.
88
1972
On preemptive scheduling of unrelated parallel processors by linear programming. Zbl 0388.68027
Lawler, E. L.; Labetoulle, J.
81
1978
Well-solved special cases. Zbl 0631.90081
Gilmore, P. C.; Lawler, E. L.; Shmoys, D. B.
79
1985
Linear-time computation of optimal subgraphs of decomposable graphs. Zbl 0618.68058
Bern, M. W.; Lawler, E. L.; Wong, A. L.
70
1987
Combinatorial optimization. Networks and matroids. Repr. Zbl 1058.90057
Lawler, Eugene
68
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.
66
1984
A note on the complexity of the chromatic number problem. Zbl 0336.68021
Lawler, E. L.
63
1976
Matroid intersection algorithms. Zbl 0315.90039
Lawler, Eugene L.
47
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
44
1990
Recent results in the theory of machine scheduling. Zbl 0547.90042
Lawler, E. L.
42
1983
Efficient implementation of dynamic programming algorithms for sequencing problems. Zbl 0416.90036
Lawler, E. L.
32
1979
Computing maximal ”polymatroidal” network flows. Zbl 0498.90029
Lawler, E. L.; Martel, C. U.
31
1982
Minimizing maximum lateness in a two-machine open shop. Zbl 0496.90047
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
31
1981
Cutsets and partitions of hypergraphs. Zbl 0262.05126
Lawler, E. L.
28
1973
A fully polynomial approximation scheme for the total tardiness problem. Zbl 0511.90074
Lawler, E. L.
26
1982
Sublinear approximate string matching and biological applications. Zbl 0942.68575
Chang, W. I.; Lawler, E. L.
26
1994
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.
24
1980
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘Tower of Sets’ property. Zbl 0810.90070
Lawler, E. L.
24
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.
22
1981
Sequencing to minimize the weighted number of tardy jobs. Zbl 0333.68044
Lawler, E. L.
22
1976
Edge coloring of hypergraphs and a conjecture of Erdős, Faber, Lovász. Zbl 0661.05026
Chang, W. I.; Lawler, E. L.
20
1988
Preemptive scheduling of precedence-constrained jobs on parallel machines. Zbl 0495.68031
Lawler, E. L.
15
1982
Determining the evolutionary tree using experiments. Zbl 0857.68082
Kannan, Sampath K.; Lawler, Eugene L.; Warnow, Tandy J.
15
1996
Recent developments in deterministic sequencing and scheduling: A survey. Zbl 0474.68056
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
14
1981
Some aspects of duality in combinatorial optimization. Zbl 0362.90076
Lawler, E. L.
14
1975
Approximation algorithms for tree alignment with a given phylogeny. Zbl 0862.68119
Wang, Lusheng; Jiang, Tao; Lawler, E. L.
14
1996
Solving the weighted parity problem for gammoids by reduction to graphic matching. Zbl 0566.05017
Tong, Po; Lawler, E. L.; Vazirani, V. V.
14
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
Shortest path and network flow algorithms. Zbl 0453.90099
Lawler, Eugene L.
11
1979
Optimal cycles in doubly weighted directed linear graphs. Zbl 0196.56301
Lawler, E. L.
11
1967
Scheduling periodically occurring tasks on multiple processors. Zbl 0454.68018
Lawler, Eugene L.; Martel, Charles U.
10
1981
Scheduling open shops with parallel machines. Zbl 0489.90053
Lawler, E. L.; Luby, M. G.; Vazirani, V. V.
10
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.
10
1982
Minimization of time-varying costs in single-machine scheduling. Zbl 0385.90055
Lawler, E. L.; Sivazlian, B. D.
10
1978
Approximation algorithms for multiple sequence alignment. Zbl 0911.68070
Bafna, Vineet; Lawler, Eugene L.; Pevzner, Pavel A.
10
1997
Fast approximation algorithms for knapsack problems. Zbl 0389.90071
Lawler, E. L.
9
1978
Aligning sequences via an evolutionary tree: complexity and approximation. Zbl 1345.92106
Jiang, Tao; Lawler, Eugene L.; Wang, Lusheng
9
1994
Optimal matroid intersections. Zbl 0256.05014
Lawler, Eugene L.
8
1970
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.
8
1978
Module clustering to minimize delay in digital networks. Zbl 0172.20603
Lawler, E. L.; Levitt, K. N.; Turner, James
7
1969
The quadratic assignment problem: A brief review. Zbl 0306.90057
Lawler, E. L.
7
1975
Covering problems. Duality relations and a new method of solution. Zbl 0143.42402
Lawler, E. L.
7
1966
Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979). Zbl 0484.68028
6
1981
Flow network formulations of polymatroid optimization problems. Zbl 0504.90018
Lawler, E. L.; Martel, C. U.
5
1982
Optimal sequencing of jobs subject to series parallel precedence constraints. Zbl 0332.90023
Lawler, E. L.
5
1975
A faster algorithm for finding edge-disjoint branchings. Zbl 0509.68060
Tong, Po; Lawler, E. L.
4
1983
An introduction to matroid optimization. Zbl 0359.90055
Lawler, E. L.
4
1975
Preemptive scheduling of uniform parallel machines to minimize the weighted number of late jobs. Zbl 0416.90035
Lawler, E. L.
4
1979
An algorithm for “Ulam’s Game” and its application to error correcting codes. Zbl 0875.94119
Lawler, Eugene L.; Sarkissian, Sergei
4
1995
Optimal cycles in graphs and the minimal cost-to-time ratio problem. Zbl 0296.90047
Lawler, Eugene L.
4
1972
A solvable case of the traveling salesman problem. Zbl 0242.90036
Lawler, Eugene L.
4
1971
Optimal preemptive scheduling of two unrelated processors. Zbl 0755.90042
Gonzales, Teofilo; Lawler, Eugene L.; Sahni, Sartaj
4
1990
Finding shortest paths in very large networks. Zbl 0552.90089
Lawler, E. L.; Luby, M. G.; Parker, B.
4
1983
Determining the evolutionary tree. Zbl 0800.68618
Kannan, Sampath; Lawler, Eugene; Warnow, Tandy
4
1990
Submodular functions and polymatroid optimization. Zbl 0563.90073
Lawler, E. L.
4
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
Machine scheduling with precedence constraints. Zbl 0474.68057
Lawler, E. L.; Lenstra, J. K.
2
1981
Machine scheduling with precedence constraints. Zbl 0489.90054
Lawler, E. L.; Lenstra, J. K.
2
1982
The complexity of combinatorial computations. A survey. Zbl 0257.68035
Lawler, E. L.
2
1971
Comment on computing the k shortest paths in a graph. Zbl 0352.68057
Lawler, Eugene L.
2
1977
A matroid generalization of a theorem of Mendelsohn and Dulmage. Zbl 0249.05017
Kundu, Sukhamay; Lawler, Eugene L.
2
1973
An approach to multilevel Boolean minimization. Zbl 0126.32801
Lawler, E.
2
1964
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 precedence-constrained jobs on parallel machines. Zbl 0474.68055
Lawler, E. L.
1
1981
The great mathematical sputnik of 1979. Zbl 0444.90055
Lawler, Eugene L.
1
1980
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
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
Computing shortest paths in networks derived from recurrence relations. Zbl 0736.90074
Lawler, E. L.
1
1991
Polymatroidal flows with lower bounds. Zbl 0626.90025
Lawler, E. L.; Martel, C. U.
1
1986
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
68
2001
Approximation algorithms for multiple sequence alignment. Zbl 0911.68070
Bafna, Vineet; Lawler, Eugene L.; Pevzner, Pavel A.
10
1997
Determining the evolutionary tree using experiments. Zbl 0857.68082
Kannan, Sampath K.; Lawler, Eugene L.; Warnow, Tandy J.
15
1996
Approximation algorithms for tree alignment with a given phylogeny. Zbl 0862.68119
Wang, Lusheng; Jiang, Tao; Lawler, E. L.
14
1996
An algorithm for “Ulam’s Game” and its application to error correcting codes. Zbl 0875.94119
Lawler, Eugene L.; Sarkissian, Sergei
4
1995
Sublinear approximate string matching and biological applications. Zbl 0942.68575
Chang, W. I.; Lawler, E. L.
26
1994
Knapsack-like scheduling problems, the Moore-Hodgson algorithm and the ‘Tower of Sets’ property. Zbl 0810.90070
Lawler, E. L.
24
1994
Aligning sequences via an evolutionary tree: complexity and approximation. Zbl 1345.92106
Jiang, Tao; Lawler, Eugene L.; Wang, Lusheng
9
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
44
1990
Optimal preemptive scheduling of two unrelated processors. Zbl 0755.90042
Gonzales, Teofilo; Lawler, Eugene L.; Sahni, Sartaj
4
1990
Determining the evolutionary tree. Zbl 0800.68618
Kannan, Sampath; Lawler, Eugene; Warnow, Tandy
4
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.
20
1988
Linear-time computation of optimal subgraphs of decomposable graphs. Zbl 0618.68058
Bern, M. W.; Lawler, E. L.; Wong, A. L.
70
1987
Polymatroidal flows with lower bounds. Zbl 0626.90025
Lawler, E. L.; Martel, C. U.
1
1986
The traveling salesman problem. A guided tour of combinatorial optimization. Reprint. Zbl 0562.00014
318
1985
The traveling salesman problem. Bibliography. Zbl 0563.90075
175
1985
Well-solved special cases. Zbl 0631.90081
Gilmore, P. C.; Lawler, E. L.; Shmoys, D. B.
79
1985
Submodular functions and polymatroid optimization. Zbl 0563.90073
Lawler, E. L.
4
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.
66
1984
Solving the weighted parity problem for gammoids by reduction to graphic matching. Zbl 0566.05017
Tong, Po; Lawler, E. L.; Vazirani, V. V.
14
1984
Recent results in the theory of machine scheduling. Zbl 0547.90042
Lawler, E. L.
42
1983
A faster algorithm for finding edge-disjoint branchings. Zbl 0509.68060
Tong, Po; Lawler, E. L.
4
1983
Finding shortest paths in very large networks. Zbl 0552.90089
Lawler, E. L.; Luby, M. G.; Parker, B.
4
1983
The recognition of series parallel digraphs. Zbl 0478.68065
Valdes, Jacobo; Tarjan, Robert E.; Lawler, Eugene L.
229
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.
31
1982
A fully polynomial approximation scheme for the total tardiness problem. Zbl 0511.90074
Lawler, E. L.
26
1982
Preemptive scheduling of precedence-constrained jobs on parallel machines. Zbl 0495.68031
Lawler, E. L.
15
1982
Scheduling open shops with parallel machines. Zbl 0489.90053
Lawler, E. L.; Luby, M. G.; Vazirani, V. V.
10
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.
10
1982
Flow network formulations of polymatroid optimization problems. Zbl 0504.90018
Lawler, E. L.; Martel, C. U.
5
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.
2
1982
Minimizing maximum lateness in a two-machine open shop. Zbl 0496.90047
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
31
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.
22
1981
Recent developments in deterministic sequencing and scheduling: A survey. Zbl 0474.68056
Lawler, E. L.; Lenstra, J. K.; Rinnooy Kan, A. H. G.
14
1981
Scheduling periodically occurring tasks on multiple processors. Zbl 0454.68018
Lawler, Eugene L.; Martel, Charles U.
10
1981
Analysis and design of algorithms in combinatorial optimization. (School held in Udine in September 1979). Zbl 0484.68028
6
1981
Machine scheduling with precedence constraints. Zbl 0474.68057
Lawler, E. L.; Lenstra, J. K.
2
1981
Preemptive scheduling of precedence-constrained jobs on parallel machines. Zbl 0474.68055
Lawler, E. L.
1
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.
99
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.
24
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.
106
1979
Efficient implementation of dynamic programming algorithms for sequencing problems. Zbl 0416.90036
Lawler, E. L.
32
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.
98
1978
On preemptive scheduling of unrelated parallel processors by linear programming. Zbl 0388.68027
Lawler, E. L.; Labetoulle, J.
81
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
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.
8
1978
A ”pseudopolynomial” algorithm for sequencing jobs to minimize total tardiness. Zbl 0353.68071
Lawler, Eugene L.
174
1977
Comment on computing the k shortest paths in a graph. Zbl 0352.68057
Lawler, Eugene L.
2
1977
Combinatorial optimization: Networks and matroids. Zbl 0413.90040
Lawler, Eugene L.
551
1976
Graphical algorithms and their complexity. Zbl 0358.68059
Lawler, E. L.
257
1976
A note on the complexity of the chromatic number problem. Zbl 0336.68021
Lawler, E. L.
63
1976
Sequencing to minimize the weighted number of tardy jobs. Zbl 0333.68044
Lawler, E. L.
22
1976
Matroid intersection algorithms. Zbl 0315.90039
Lawler, Eugene L.
47
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.
4
1975
Optimal sequencing of a single machine subjec t to precedence constraints. Zbl 0254.90039
Lawler, E. L.
144
1973
Cutsets and partitions of hypergraphs. Zbl 0262.05126
Lawler, E. L.
28
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.
88
1972
Optimal cycles in graphs and the minimal cost-to-time ratio problem. Zbl 0296.90047
Lawler, Eugene L.
4
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.
8
1970
A functional equation and its application to resource allocation and sequencing problems. Zbl 0184.23303
Lawler, E. L.; Moore, J. M.
142
1969
Module clustering to minimize delay in digital networks. Zbl 0172.20603
Lawler, E. L.; Levitt, K. N.; Turner, James
7
1969
Optimal cycles in doubly weighted directed linear graphs. Zbl 0196.56301
Lawler, E. L.
11
1967
Branch-and-bound methods. A survey. Zbl 0143.42501
Lawler, E. L.; Wood, D. E.
160
1966
Covering problems. Duality relations and a new method of solution. Zbl 0143.42402
Lawler, E. L.
7
1966
An approach to multilevel Boolean minimization. Zbl 0126.32801
Lawler, E.
2
1964
The quadratic assignment problem. Zbl 0995.90579
Lawler, Eugene L.
165
1963
Electrical assemblies with a minimum number of interconnections. Zbl 0127.08702
Lawler, E. L.
1
1962
all top 5

Cited by 5,929 Authors

79 Cheng, Tai-Chiu Edwin
71 Yuan, Jinjiang
69 Wang, Ji-Bo
44 Woeginger, Gerhard
42 Shabtay, Dvir
40 Pardalos, Panos M.
34 Leung, Joseph Y.-T.
34 Werner, Frank
32 Błażewicz, Jacek
30 Steiner, George
29 Ng, C. T. Daniel
29 Strusevich, Vitaly A.
26 Kovalëv, Mikhail Yakovlevich
24 Pinedo, Michael L.
23 Punnen, Abraham P.
22 Della Croce, Federico
21 Liu, Xinbao
21 Pei, Jun
21 T’kindt, Vincent
20 He, Cheng
20 Jansen, Klaus
20 Potts, Chris N.
19 Burkard, Rainer E.
19 Sriskandarajah, Chelliah
19 Yang, Dar-Li
19 Yin, Yunqiang
18 Bampis, Evripidis
17 Deĭneko, Vladimir G.
17 Koulamas, Christos P.
17 Lazarev, Aleksander Alekseevich
17 Lenstra, Jan Karel
17 Makino, Kazuhisa
16 Hoogeveen, Johannes Adzer
16 Huo, Yumei
16 Ibaraki, Toshihide
16 Ji, Min
16 Kis, Tamás
16 Lu, Lingfa
16 Ma, Ran
16 Maffioli, Francesco
16 Pesch, Erwin
16 Yang, Shanlin
15 Boros, Endre
15 Boysen, Nils
15 Briskorn, Dirk
15 Brucker, Peter J.
15 Chu, Chengbin
15 Framinan, Jose M.
15 Hurink, Johann L.
15 Ji, Ping
15 Kasperski, Adam
15 Kubiak, Wiesław X.
15 Lin, Yixun
15 Toth, Paolo
14 Choi, Byung-Cheon
14 Elbassioni, Khaled M.
14 Gabow, Harold N.
14 Giroudeau, Rodolphe
14 Hochbaum, Dorit S.
14 Huang, Xue
14 Krumke, Sven Oliver
14 Lee, Kangbok
14 Li, Shisheng
14 Lin, Bertrand Miao-Tsong
14 Ruiz, Rubén
14 Wang, Jianjun
14 Zhang, Yuzhong
13 Camerini, Paolo M.
13 de Werra, Dominique
13 Gordon, Valery S.
13 Janiak, Adam
13 Leus, Roel
13 Mosheiov, Gur
13 Nagamochi, Hiroshi
13 Orlin, James B.
13 Rinnooy Kan, Alexander Hendrik George
13 Shakhlevich, Natalia V.
13 Wu, Chin-Chia
12 Baptiste, Philippe
12 Bodlaender, Hans L.
12 Gouveia, Luis
12 Gurvich, Vladimir A.
12 Hamacher, Horst W.
12 Hassin, Refael
12 König, Jean-Claude
12 Laporte, Gilbert
12 Li, Kai
12 Li, Shuguang
12 Lin, Guohui
12 Queyranne, Maurice
12 Uno, Takeaki
12 Xu, Dehua
11 Billaut, Jean-Charles
11 Chentsov, Aleksandr Georgievich
11 Fan, Wenjuan
11 Györgyi, Péter
11 Jacobson, Sheldon H.
11 Kuo, Wen-Hung
11 Lin, Hao
11 Megow, Nicole
...and 5,829 more Authors
all top 5

Cited in 337 Serials

664 European Journal of Operational Research
388 Computers & Operations Research
363 Discrete Applied Mathematics
211 Theoretical Computer Science
196 Journal of Scheduling
185 Operations Research Letters
136 Annals of Operations Research
129 Information Processing Letters
104 Mathematical Programming. Series A. Series B
99 Algorithmica
95 Journal of Combinatorial Optimization
93 Networks
60 Applied Mathematical Modelling
59 Discrete Mathematics
57 Optimization Letters
52 Asia-Pacific Journal of Operational Research
38 Mathematical Programming
37 Naval Research Logistics
36 Discrete Optimization
33 Applied Mathematics and Computation
33 Mathematical Problems in Engineering
32 Mathematical and Computer Modelling
31 Artificial Intelligence
31 RAIRO. Operations Research
30 International Journal of Production Research
28 Information Sciences
27 Journal of Computer and System Sciences
24 International Transactions in Operational Research
22 Automation and Remote Control
22 Linear Algebra and its Applications
21 Computers & Mathematics with Applications
21 Journal of Global Optimization
21 Computational Optimization and Applications
21 Journal of Industrial and Management Optimization
20 Engineering Optimization
19 Optimization
19 4OR
18 Computing
17 Information and Computation
17 Theory of Computing Systems
16 International Journal of Systems Science
16 Journal of Combinatorial Theory. Series B
16 International Journal of Foundations of Computer Science
16 Journal of the Operations Research Society of China
15 Journal of Optimization Theory and Applications
15 SIAM Journal on Computing
14 SIAM Journal on Discrete Mathematics
14 INFORMS Journal on Computing
14 Journal of Discrete Algorithms
13 SIAM Journal on Algebraic and Discrete Methods
13 Order
13 OR Spectrum
13 Journal of Applied Mathematics and Computing
12 Japan Journal of Industrial and Applied Mathematics
12 Journal of Heuristics
12 CEJOR. Central European Journal of Operations Research
11 European Journal of Combinatorics
11 Combinatorica
11 International Journal of Computer Mathematics
11 ZOR. Zeitschrift für Operations Research
11 Mathematical Methods of Operations Research
11 Algorithms
10 Mathematics of Operations Research
10 Zeitschrift für Operations Research. Serie A: Theorie
10 Applied Mathematics. Series B (English Edition)
9 Journal of Computational and Applied Mathematics
9 Applied Mathematics Letters
8 Acta Informatica
8 Automatica
8 Fuzzy Sets and Systems
8 Opsearch
8 Top
8 Optimization Methods & Software
8 Discrete Dynamics in Nature and Society
8 Journal of Applied Mathematics
7 Journal of Soviet Mathematics
7 Journal of Information & Optimization Sciences
7 Computational and Applied Mathematics
7 Proceedings of the Steklov Institute of Mathematics
7 Mathematical Programming Computation
6 BIT
6 Journal of Combinatorial Theory. Series A
6 Operations Research
6 Acta Mathematicae Applicatae Sinica. English Series
6 Computational Geometry
6 Constraints
6 Probability in the Engineering and Informational Sciences
6 Optimization and Engineering
6 International Journal of Systems Science. Principles and Applications of Systems and Integration
5 Journal of Statistical Physics
5 Journal of Graph Theory
5 Statistica Neerlandica
5 OR Spektrum
5 International Journal of Approximate Reasoning
5 SIAM Journal on Optimization
5 Soft Computing
5 Journal of the ACM
5 Natural Computing
5 Discrete Mathematics, Algorithms and Applications
5 ACM Transactions on Algorithms
...and 237 more Serials
all top 5

Cited in 47 Fields

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

Citations by Year

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