default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid L. Jensen
Person information
- affiliation: IBM Thomas J. Watson Research Center, Yorktown Heights, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2012
[j7]Gerard Miller, Melissa Weatherwax, Timothy Gardinier, Naoki Abe, Prem Melville, Cezar Pendus, David L. Jensen, Chandan K. Reddy
, Vince P. Thomas, James J. Bennett, Gary F. Anderson, Brent R. Cooley:
Tax Collections Optimization for New York State. Interfaces 42(1): 74-84 (2012)- 2010
- [c4]Naoki Abe, Prem Melville, Cezar Pendus, Chandan K. Reddy, David L. Jensen, Vince P. Thomas, James J. Bennett, Gary F. Anderson, Brent R. Cooley, Melissa Kowalczyk, Mark Domick, Timothy Gardinier:
Optimizing debt collections using constrained reinforcement learning. KDD 2010: 75-84 - [c3]Chen Jiang, David L. Jensen, Heng Cao, Tarun Kumar:
Building Business Intelligence Applications Having Prescriptive and Predictive Capabilities. WAIM 2010: 376-385
2000 – 2009
- 2003
- [c2]Haifeng Xi, Heng Cao, Leonard Berman, David L. Jensen:
Supply chain simulation: distributed supply chain simulation using a generic job running framework. WSC 2003: 1305-1312
1990 – 1999
- 1998
- [j6]Francisco Barahona, David L. Jensen:
Plant location with minimum inventory. Math. Program. 83: 101-111 (1998) - 1994
- [j5]David L. Jensen, Roman A. Polyak:
The convergence of a modified barrier method for convex programming. IBM J. Res. Dev. 38(3): 307-322 (1994) - 1992
- [j4]David L. Jensen, Alan J. King:
A Decomposition Method for Quadratic Programming. IBM Syst. J. 31(1): 39-48 (1992) - [j3]David L. Jensen, Alan J. King:
Frontier: A Graphical Interface for Portfolio Optimization in a Piecewise Linear-Quadratic Risk Framework. IBM Syst. J. 31(1): 62-70 (1992) - [j2]Robert G. Bland, David L. Jensen:
On the computational behavior of a polynomial-time network flow algorithm. Math. Program. 54: 1-39 (1992) - 1991
- [c1]Robert G. Bland, Joseph Cheriyan, David L. Jensen, Laszlo Ladányi:
An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem. Network Flows And Matching 1991: 119-156
1980 – 1989
- 1989
- [j1]Sunil Chopra, David L. Jensen, Ellis L. Johnson:
Polyhedra of regularp-nary group problems. Math. Program. 43(1-3): 1-29 (1989)
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-08 21:45 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:
