default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrew J. Davenport
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2011
[j6]Arun Hampapur, H. Cao, Andrew J. Davenport, W. S. Dong, Don Fenhagen, Rogério Schmidt Feris, Germán S. Goldszmidt, Z. B. Jiang, Jayant Kalagnanam, Tarun Kumar, H. Li, Xuan Liu, Shilpa Mahatma, Sharath Pankanti, D. Pelleg, W. Sun, M. Taylor, Chunhua Tian, Segev Wasserkrug, Lexing Xie
, Mujib Lodhi, C. Kiely, K. Butturff, L. Desjardins:
Analytics-driven asset management. IBM J. Res. Dev. 55(1): 13 (2011)- 2010
- [c9]Andrew J. Davenport:
Integrated Maintenance Scheduling for Semiconductor Manufacturing. CPAIOR 2010: 92-96 - [c8]Feng Xie, Andrew J. Davenport:
Massively Parallel Constraint Programming for Supercomputers: Challenges and Initial Results. CPAIOR 2010: 334-338
2000 – 2009
- 2007
- [c7]Andrew J. Davenport, Jayant Kalagnanam, Chandra Reddy, Stuart Siegel, John Hou:
An Application of Constraint Programming to Generating Detailed Operations Schedules for Steel Manufacturing. CP 2007: 64-76 - 2006
- [c6]Vincent Conitzer, Andrew J. Davenport, Jayant Kalagnanam:
Improved Bounds for Computing Kemeny Rankings. AAAI 2006: 620-626 - 2004
- [j5]Hiroyuki Okano, Andrew J. Davenport, Mark Trumbo, Chandra Reddy, Kunikazu Yoda, Masami Amano:
Finishing Line Scheduling in the steel industry. IBM J. Res. Dev. 48(5-6): 811-830 (2004) - [c5]Andrew J. Davenport, Jayant Kalagnanam:
A Computational Study of the Kemeny Rule for Preference Aggregation. AAAI 2004: 697-702 - 2003
- [j4]Gail Hohner, John Rich, Ed Ng, Grant Reid, Andrew J. Davenport, Jayant R. Kalagnanam, Ho Soo Lee, Chae An:
Special Issue: 2002 Franz Edelman Award for Achievement in Operations Research and the Management Sciences: Combinatorial and Quantity-Discount Procurement Auctions Benefit Mars, Incorporated and Its Suppliers. Interfaces 33(1): 23-35 (2003) - 2002
- [j3]F. Sibel Salman, Jayant Kalagnanam, Sesh Murthy, Andrew J. Davenport:
Cooperative Strategies for Solving the Bicriteria Sparse Multiple Knapsack Problem. J. Heuristics 8(2): 215-239 (2002) - 2001
- [j2]Jayant Kalagnanam, Andrew J. Davenport, Ho Soo Lee:
Computational Aspects of Clearing Continuous Call Double Auctions with Assignment Constraints and Indivisible Demand. Electron. Commer. Res. 1(3): 221-238 (2001) - 2000
- [j1]J. Christopher Beck, Andrew J. Davenport, Claude Le Pape:
Introduction. Constraints An Int. J. 5(4): 327-334 (2000)
1990 – 1999
- 1997
- [c4]J. Christopher Beck, Andrew J. Davenport, Edward M. Sitarski, Mark S. Fox:
Beyond Contention: Extending Texture-Based Scheduling Heuristics. AAAI/IAAI 1997: 233-240 - [c3]J. Christopher Beck, Andrew J. Davenport, Edward M. Sitarski, Mark S. Fox:
Texture-Based Heuristics for Scheduling Revisited. AAAI/IAAI 1997: 241-248 - [c2]J. Christopher Beck, Andrew J. Davenport, Mark S. Fox:
Five Pitfalls of Empirical Scheduling Research. CP 1997: 390-404 - 1994
- [c1]Andrew J. Davenport, Edward P. K. Tsang, Chang J. Wang, Kangmin Zhu:
GENET: A Connectionist Architecture for Solving Constraint Satisfaction Problems by Iterative Improvement. AAAI 1994: 325-330
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-08-22 20:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
