( en | de | ru )

 

Disambiguation of "Jensen, David L."

Author of the publication

copydeleteadd this publication to your clipboard
Plant location with minimum inventory.

, and . Math. Program., (1998)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

David Jensen

David L Dowdey

David L Weakliem

David L Largent

L Solymosi

 

Other publications of authors with the same name

Polyhedra of regularp-nary group problems., , and . Math. Program., 43 (1-3): 1-29 (1989)Building Business Intelligence Applications Having Prescriptive and Predictive Capabilities., , , and . WAIM, volume 6184 of Lecture Notes in Computer Science, page 376-385. Springer, (2010)Optimizing debt collections using constrained reinforcement learning., , , , , , , , , and 2 other author(s). KDD, page 75-84. ACM, (2010)Frontier: A Graphical Interface for Portfolio Optimization in a Piecewise Linear-Quadratic Risk Framework., and . IBM Syst. J., 31 (1): 62-70 (1992)On the computational behavior of a polynomial-time network flow algorithm., and . Math. Program., (1992)The convergence of a modified barrier method for convex programming., and . IBM J. Res. Dev., 38 (3): 307-322 (1994)A Decomposition Method for Quadratic Programming., and . IBM Syst. J., 31 (1): 39-48 (1992)Tax Collections Optimization for New York State., , , , , , , , , and 2 other author(s). Interfaces, 42 (1): 74-84 (2012)Supply chain simulation: distributed supply chain simulation using a generic job running framework., , , and . WSC, page 1305-1312. IEEE Computer Society, (2003)An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem., , , and . Network Flows And Matching, volume 12 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 119-156. DIMACS/AMS, (1991)