default search action
Michael A. Trick
Person information
- affiliation: Carnegie Mellon University, Pittsburgh, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j26]Jean L. Kiddoo, Evan Kwerel, Sasha Javid, Melissa Dunford, Gary M. Epstein, Charles E. Meisch Jr., Karla L. Hoffman, Brian B. Smith, Anthony B. Coudert, Rudy K. Sultana, James A. Costa, Steven Charbonneau, Michael A. Trick, Ilya Segal, Kevin Leyton-Brown, Neil Newman, Alexandre Fréchette, Dinesh Menon, Paul Salasznyk:
Operations Research Enables Auction to Repurpose Television Spectrum for Next-Generation Wireless Technologies. INFORMS J. Appl. Anal. 49(1): 7-22 (2019) - 2017
- [j25]R. John Milne, Michael A. Trick:
Introduction: 2016 Franz Edelman Award for Achievement in Operations Research and the Management Sciences. Interfaces 47(1): 4-7 (2017) - 2016
- [j24]R. John Milne, Michael A. Trick:
Introduction: 2015 Franz Edelman Award for Achievement in Operations Research and the Management Sciences. Interfaces 46(1): 1-4 (2016) - [c16]Supriyo Ghosh, Michael A. Trick, Pradeep Varakantham:
Robust Repositioning to Counter Unpredictable Demand in Bike Sharing Systems. IJCAI 2016: 3096-3102 - 2014
- [j23]Nihat Altintas, Michael A. Trick:
A data mining approach to forecast behavior. Ann. Oper. Res. 216(1): 3-22 (2014) - [c15]Joris Kinable, Michael A. Trick:
A Logic Based Benders' Approach to the Concrete Delivery Problem. CPAIOR 2014: 176-192 - 2012
- [j22]Michael A. Trick, Hakan Yildiz:
Locally Optimized Crossover for the Traveling Umpire Problem. Eur. J. Oper. Res. 216(2): 286-292 (2012) - [j21]Michael A. Trick, Hakan Yildiz, Tallys H. Yunes:
Scheduling Major League Baseball Umpires and the Traveling Umpire Problem. Interfaces 42(3): 232-244 (2012) - 2011
- [j20]Laurent Perron, Michael A. Trick:
Foreword. Ann. Oper. Res. 184(1): 1 (2011) - [j19]David Simchi-Levi, Michael A. Trick:
Introduction to "Little's Law as Viewed on Its 50th Anniversary". Oper. Res. 59(3): 535 (2011)
2000 – 2009
- 2009
- [j18]Rasmus V. Rasmussen, Michael A. Trick:
The timetable constrained distance minimization problem. Ann. Oper. Res. 171(1): 45-59 (2009) - [c14]Benjamin Peterson, Michael A. Trick:
A Benders'Approach to a Transportation Network Design Problem. CPAIOR 2009: 326-327 - 2008
- [j17]David S. Johnson, Anuj Mehrotra, Michael A. Trick:
Special issue on computational methods for graph coloring and its generalizations. Discret. Appl. Math. 156(2): 145-146 (2008) - [j16]Cliff T. Ragsdale, Kevin P. Scheibe, Michael A. Trick:
Fashioning fair foursomes for the fairway (using a spreadsheet-based DSS as the driver). Decis. Support Syst. 45(4): 997-1006 (2008) - [j15]Rasmus V. Rasmussen, Michael A. Trick:
Round robin scheduling - a survey. Eur. J. Oper. Res. 188(3): 617-636 (2008) - [j14]Michael A. Trick:
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. Oper. Res. Lett. 36(2): 276-277 (2008) - [e3]Laurent Perron, Michael A. Trick:
Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 5th International Conference, CPAIOR 2008, Paris, France, May 20-23, 2008, Proceedings. Lecture Notes in Computer Science 5015, Springer 2008, ISBN 978-3-540-68154-0 [contents] - 2007
- [j13]Rasmus V. Rasmussen, Michael A. Trick:
A Benders approach for the constrained minimum break problem. Eur. J. Oper. Res. 177(1): 198-213 (2007) - [j12]Anthony Pajunas, Edward J. Matto, Michael A. Trick, Luis F. Zuluaga:
Optimizing Highway Transportation at the United States Postal Service. Interfaces 37(6): 515-525 (2007) - [c13]Michael A. Trick, Hakan Yildiz:
Bender's Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem. CPAIOR 2007: 332-345 - [c12]Michael A. Trick, Hakan Yildiz:
A Large Neighborhood Search Heuristic for Graph Coloring. CPAIOR 2007: 346-360 - 2006
- [c11]Rasmus V. Rasmussen, Michael A. Trick:
The Timetable Constrained Distance Minimization Problem. CPAIOR 2006: 167-181 - 2005
- [c10]Michael A. Trick:
Formulations and Reformulations in Integer Programming. CPAIOR 2005: 366-379 - [e2]Edmund K. Burke, Michael A. Trick:
Practice and Theory of Automated Timetabling V, 5th International Conference, PATAT 2004, Pittsburgh, PA, USA, August 18-20, 2004, Revised Selected Papers. Lecture Notes in Computer Science 3616, Springer 2005, ISBN 3-540-30705-2 [contents] - 2004
- [j11]Robert P. Bosch Jr., Michael A. Trick:
Constraint Programming and Hybrid Formulations for Three Life Designs. Ann. Oper. Res. 130(1-4): 41-56 (2004) - [r1]Kelly Easton, George L. Nemhauser, Michael A. Trick:
Sports Scheduling. Handbook of Scheduling 2004 - 2003
- [j10]Michael A. Trick:
A Dynamic Programming Approach for Consistency and Propagation for Knapsack Constraints. Ann. Oper. Res. 118(1-4): 73-84 (2003) - 2002
- [c9]Michael A. Trick:
Integer and Constraint Programming Approaches for Round-Robin Tournament Scheduling. PATAT 2002: 63-77 - [c8]Kelly Easton, George L. Nemhauser, Michael A. Trick:
Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach. PATAT 2002: 100-112 - 2001
- [j9]Anuj Mehrotra, N. R. Natraj, Michael A. Trick:
Consolidating Maintenance Spares. Comput. Optim. Appl. 18(3): 251-272 (2001) - [c7]Kelly Easton, George L. Nemhauser, Michael A. Trick:
The Traveling Tournament Problem Description and Benchmarks. CP 2001: 580-584 - 2000
- [c6]Michael A. Trick:
A Schedule-Then-Break Approach to Sports Timetabling. PATAT 2000: 242-253
1990 – 1999
- 1998
- [j8]Michael A. Trick:
]ary - The World Wide Web: It's the Customers. INFORMS J. Comput. 10(4): 393-395 (1998) - [j7]George L. Nemhauser, Michael A. Trick:
Scheduling A Major College Basketball Conference. Oper. Res. 46(1): 1-8 (1998) - [j6]Anuj Mehrotra, Michael A. Trick:
Cliques and clustering: A combinatorial approach. Oper. Res. Lett. 22(1): 1-12 (1998) - 1996
- [j5]Anuj Mehrotra, Michael A. Trick:
A Column Generation Approach for Graph Coloring. INFORMS J. Comput. 8(4): 344-354 (1996) - [c5]George Christopher, Martin Farach, Michael A. Trick:
The Structure of Circular Decomposable Metrics. ESA 1996: 486-500 - [e1]David S. Johnson, Michael A. Trick:
Cliques, Coloring, and Satisfiability, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 11-13, 1993. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 26, DIMACS/AMS 1996, ISBN 978-0-8218-6609-2 [contents] - 1994
- [j4]Michael A. Trick:
Scheduling Multiple Variable-Speed Machines. Oper. Res. 42(2): 234-248 (1994) - 1993
- [j3]Donna Crystal Llewellyn, Craig A. Tovey, Michael A. Trick:
Erratum: Local Optimization on Graphs. Discret. Appl. Math. 46(1): 93-94 (1993) - [c4]David S. Johnson, Michael A. Trick:
Foreword xiIntroduction to the Second DIMACS Challenge: Cliques, coloring, and satisfiability. Cliques, Coloring, and Satisfiability 1993: 1-7 - [c3]Michael A. Trick:
Appendix: Second DIMACS Challenge test problems. Cliques, Coloring, and Satisfiability 1993: 653-657 - 1992
- [c2]Shmuel Ur, Michael A. Trick, Daniel Dominic Sleator:
Analysis of Online Algorithms for Organ Allocation. IFIP Congress (1) 1992: 458-464 - 1990
- [c1]Michael A. Trick:
Scheduling Multiple Variable-Speed Machines. IPCO 1990: 485-494
1980 – 1989
- 1989
- [j2]Donna Crystal Llewellyn, Craig A. Tovey, Michael A. Trick:
Local optimization on graphs. Discret. Appl. Math. 23(2): 157-178 (1989) - 1986
- [j1]Éva Tardos, Craig A. Tovey, Michael A. Trick:
Layered Augmenting Path Algorithms. Math. Oper. Res. 11(2): 362-370 (1986)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint