| Year |
Citation |
Score |
| 2012 |
Trick MA, Yildiz H, Yunes T. Scheduling Major League Baseball Umpires and the Traveling Umpire Problem Interfaces. 42: 232-244. DOI: 10.1287/Inte.1100.0514 |
0.321 |
|
| 2012 |
Trick MA, Yildiz H. Locally optimized crossover for the traveling umpire problem European Journal of Operational Research. 216: 286-292. DOI: 10.1016/J.Ejor.2011.07.049 |
0.303 |
|
| 2011 |
Trick MA, Yildiz H. Benders' cuts guided large neighborhood search for the traveling umpire problem Naval Research Logistics. 58: 771-781. DOI: 10.1002/Nav.20482 |
0.318 |
|
| 2009 |
Rasmussen RV, Trick MA. The timetable constrained distance minimization problem Annals of Operations Research. 171: 45-59. DOI: 10.1007/S10479-008-0384-4 |
0.303 |
|
| 2008 |
Trick MA. David L. Applegate, Robert E. Bixby, Vasek Chvátal ,William J. Cook. The Traveling Salesman Problem: A Computational Study, Princeton University Press, Princeton, 2007, ISBN-13: 978-0-691-12993-8, 606 pp., $45. Operations Research Letters. 36: 276-277. DOI: 10.1016/J.Orl.2007.06.002 |
0.301 |
|
| 2008 |
Johnson DS, Mehrotra A, Trick MA. Preface: Special issue on computational methods for graph coloring and its generalizations Discrete Applied Mathematics. 156: 145-146. DOI: 10.1016/J.Dam.2007.10.007 |
0.309 |
|
| 2007 |
Rasmussen RV, Trick MA. A Benders approach for the constrained minimum break problem European Journal of Operational Research. 177: 198-213. DOI: 10.1016/J.Ejor.2005.10.063 |
0.32 |
|
| 2000 |
Mehrotra A, Murphy KE, Trick MA. Optimal shift scheduling: A branch-and-price approach Naval Research Logistics. 47: 185-200. DOI: 10.1002/(Sici)1520-6750(200004)47:3<185::Aid-Nav1>3.0.Co;2-7 |
0.332 |
|
| 1998 |
Mehrotra A, Trick MA. Cliques and clustering: A combinatorial approach Operations Research Letters. 22: 1-12. DOI: 10.1016/S0167-6377(98)00006-6 |
0.308 |
|
| 1996 |
Mehrotra A, Trick MA. A Column Generation Approach for Graph Coloring Informs Journal On Computing. 8: 344-354. DOI: 10.1287/Ijoc.8.4.344 |
0.329 |
|
| 1996 |
Srivastava S, Trick MA. Sophisticated voting rules: the case of two tournaments Social Choice and Welfare. 13: 275-289. DOI: 10.1007/Bf00179232 |
0.342 |
|
| 1994 |
Trick MA. Scheduling Multiple Variable-Speed Machines Operations Research. 42: 234-248. DOI: 10.1287/Opre.42.2.234 |
0.306 |
|
| 1992 |
Bartholdi JJ, Tovey CA, Trick MA. How hard is it to control an election? Mathematical and Computer Modelling. 16: 27-40. DOI: 10.1016/0895-7177(92)90085-Y |
0.667 |
|
| 1992 |
Trick MA. A Linear Relaxation Heuristic for the Generalized Assignment Problem Naval Research Logistics. 39: 137-151. DOI: 10.1002/1520-6750(199203)39:2<137::Aid-Nav3220390202>3.0.Co;2-D |
0.305 |
|
| 1989 |
Llewellyn DC, Tovey C, Trick M. Local optimization on graphs Discrete Applied Mathematics. 23: 157-178. DOI: 10.1016/0166-218X(89)90025-5 |
0.304 |
|
| 1989 |
Trick MA. Recognizing single-peaked preferences on a tree Mathematical Social Sciences. 17: 329-334. DOI: 10.1016/0165-4896(89)90060-7 |
0.312 |
|
| 1989 |
Bartholdi J, Tovey CA, Trick MA. Voting schemes for which it can be difficult to tell who won the election Social Choice and Welfare. 6: 157-165. DOI: 10.1007/Bf00303169 |
0.355 |
|
| 1989 |
Bartholdi JJ, Tovey CA, Trick MA. The computational difficulty of manipulating an election Social Choice and Welfare. 6: 227-241. DOI: 10.1007/Bf00295861 |
0.677 |
|
| 1986 |
Bartholdi JJ, Butler CA, Trick MA. More on the Evolution of Cooperation Journal of Conflict Resolution. 30: 129-140. DOI: 10.1177/0022002786030001009 |
0.656 |
|
| 1986 |
Bartholdi J, Trick MA. Stable matching with preferences derived from a psychological model Operations Research Letters. 5: 165-169. DOI: 10.1016/0167-6377(86)90072-6 |
0.662 |
|
| Show low-probability matches. |
