Polyhedra of regularp-nary group problems. - Sunil Chopra; David L. Jensen; Ellis L. Johnson (Math. Program., 1989)

An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem. - Robert G. Bland; Joseph Cheriyan; David L. Jensen; Laszlo Ladányi (Network Flows And Matching, 1991)

A Decomposition Method for Quadratic Programming. - David L. Jensen; Alan J. King (IBM Syst. J., 1992)

Frontier: A Graphical Interface for Portfolio Optimization in a Piecewise Linear-Quadratic Risk Framework. - David L. Jensen; Alan J. King (IBM Syst. J., 1992)

On the computational behavior of a polynomial-time network flow algorithm. - Robert G. Bland; David L. Jensen (Math. Program., 1992)

The convergence of a modified barrier method for convex programming. - David L. Jensen; Roman A. Polyak (IBM J. Res. Dev., 1994)

Plant location with minimum inventory. - Francisco Barahona; David L. Jensen (Math. Program., 1998)

Supply chain simulation: distributed supply chain simulation using a generic job running framework. - Haifeng Xi; Heng Cao; Leonard Berman; David L. Jensen (WSC, 2003)

Optimizing debt collections using constrained reinforcement learning. - 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 (KDD, 2010)

Building Business Intelligence Applications Having Prescriptive and Predictive Capabilities. - Chen Jiang; David L. Jensen; Heng Cao; Tarun Kumar (WAIM, 2010)

Tax Collections Optimization for New York State. - 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 (Interfaces, 2012)