default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArthur F. Veinott Jr.
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
[j15]Michael J. O'Sullivan
, Arthur F. Veinott Jr.:
Polynomial-Time Computation of Strong and n-Present-Value Optimal Policies in Markov Decision Chains. Math. Oper. Res. 42(3): 577-598 (2017)- 2015
- [j14]Iara Ciurria-Infosino, Daniel Granot, Frieda Granot, Arthur F. Veinott Jr.:
Multicommodity Production Planning: Qualitative Analysis and Applications. Manuf. Serv. Oper. Manag. 17(4): 589-607 (2015) - 2014
- [j13]B. Curtis Eaves, Arthur F. Veinott Jr.:
Maximum-Stopping-Value Policies in Finite Markov Population Decision Chains. Math. Oper. Res. 39(3): 597-606 (2014) - [j12]Iara Ciurria-Infosino, Frieda Granot, Arthur F. Veinott Jr.:
Substitutes, complements, and ripples in multicommodity flows on suspension graphs. Networks 64(2): 65-75 (2014) - 2013
- [j11]Arthur F. Veinott Jr.:
Taut-string solution of the equilibrium no-lag Clark-Scarf serial inventory problem. Ann. Oper. Res. 208(1): 27-30 (2013) - [j10]Ningxiong Xu, Arthur F. Veinott Jr.:
Sequential stochastic core of a cooperative stochastic programming game. Oper. Res. Lett. 41(5): 430-435 (2013)
1990 – 1999
- 1993
- [j9]Alan J. Hoffman, Arthur F. Veinott Jr.:
Staircase transportation problems with superadditive rewards and cumulative capacities. Math. Program. 62: 199-213 (1993)
1980 – 1989
- 1987
- [j8]Michael N. Katehakis, Arthur F. Veinott Jr.:
The Multi-Armed Bandit Problem: Decomposition and Computation. Math. Oper. Res. 12(2): 262-268 (1987) - [j7]Ranel E. Erickson, Clyde L. Monma, Arthur F. Veinott Jr.:
Send-and-Split Method for Minimum-Concave-Cost Network Flows. Math. Oper. Res. 12(4): 634-664 (1987) - 1985
- [j6]Frieda Granot, Arthur F. Veinott Jr.:
Substitutes, Complements and Ripples in Network Flows. Math. Oper. Res. 10(3): 471-497 (1985)
1970 – 1979
- 1978
- [j5]George B. Dantzig, Arthur F. Veinott Jr.:
Discovering Hidden Totally Leontief Substitution Systems. Math. Oper. Res. 3(2): 102-103 (1978) - 1973
- [j4]Yves Balcer, Arthur F. Veinott Jr.:
Computing a graph's period quadratically by node condensation. Discret. Math. 4(4): 295-303 (1973) - 1972
- [j3]Richard W. Cottle, Arthur F. Veinott Jr.:
Polyhedral sets having a least element. Math. Program. 3(1): 238-249 (1972)
1960 – 1969
- 1969
- [j2]Arthur F. Veinott Jr.:
Minimum Concave-Cost Solution of Leontief Substitution Models of Multi-Facility Inventory Systems. Oper. Res. 17(2): 262-291 (1969) - 1967
- [j1]Arthur F. Veinott Jr.:
The Supporting Hyperplane Method for Unimodal Programming. Oper. Res. 15(1): 147-152 (1967)
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-04-25 05: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:
