default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid B. Brown
Person information
- affiliation: University of A Coruña, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2023
[j26]David B. Brown
, Jingwei Zhang:
Technical Note - On the Strength of Relaxations of Weakly Coupled Stochastic Dynamic Programs. Oper. Res. 71(6): 2374-2389 (2023)- 2022
- [j25]David B. Brown, James E. Smith:
Information Relaxations and Duality in Stochastic Dynamic Programs: A Review and Tutorial. Found. Trends Optim. 5(3): 246-339 (2022) - [j24]David B. Brown, Jingwei Zhang:
Dynamic Programs with Shared Resources and Signals: Dynamic Fluid Policies and Asymptotic Optimality. Oper. Res. 70(5): 3015-3033 (2022) - 2021
- [j23]Santiago R. Balseiro, David B. Brown, Chen Chen:
Dynamic Pricing of Relocating Resources in Large Networks. Manag. Sci. 67(7): 4075-4094 (2021) - 2020
- [j22]David B. Brown, James E. Smith:
Index Policies and Performance Bounds for Dynamic Selection Problems. Manag. Sci. 66(7): 3029-3050 (2020) - 2019
- [j21]Santiago R. Balseiro, David B. Brown:
Approximations to Stochastic Dynamic Programs via Information Relaxation Duality. Oper. Res. 67(2): 577-597 (2019) - 2018
- [j20]Santiago R. Balseiro, David B. Brown, Chen Chen:
Static Routing in Stochastic Scheduling: Performance Guarantees and Asymptotic Optimality. Oper. Res. 66(6): 1641-1660 (2018) - 2017
- [j19]David B. Brown, Martin B. Haugh:
Information Relaxation Bounds for Infinite Horizon Markov Decision Processes. Oper. Res. 65(5): 1355-1379 (2017) - 2014
- [j18]David B. Brown, James E. Smith:
Information Relaxations, Duality, and Convex Stochastic Dynamic Programs. Oper. Res. 62(6): 1394-1415 (2014) - 2013
- [j17]David B. Brown, James E. Smith:
Optimal Sequential Exploration: Bandits, Clairvoyants, and Wildcats. Oper. Res. 61(3): 644-665 (2013) - 2012
- [j16]David B. Brown, Enrico G. De Giorgi, Melvyn Sim:
Aspirational Preferences and Their Representation by Risk Measures. Manag. Sci. 58(11): 2095-2113 (2012) - 2011
- [j15]David B. Brown, James E. Smith:
Dynamic Portfolio Optimization with Transaction Costs: Heuristics and Dual Bounds. Manag. Sci. 57(10): 1752-1770 (2011) - [j14]Dimitris Bertsimas, David B. Brown, Constantine Caramanis:
Theory and Applications of Robust Optimization. SIAM Rev. 53(3): 464-501 (2011) - 2010
- [j13]David B. Brown, James E. Smith, Peng Sun:
Information Relaxations and Duality in Stochastic Dynamic Programs. Oper. Res. 58(4-Part-1): 785-801 (2010) - [j12]Aharon Ben-Tal, Dimitris Bertsimas, David B. Brown:
A Soft Robust Model for Optimization Under Ambiguity. Oper. Res. 58(4-Part-2): 1220-1234 (2010) - [j11]David B. Brown, Bruce Ian Carlin, Miguel Sousa Lobo:
Optimal Portfolio Liquidation with Distress Risk. Manag. Sci. 56(11): 1997-2014 (2010) - 2009
- [j10]Dimitris Bertsimas, David B. Brown:
Constructing Uncertainty Sets for Robust Linear Optimization. Oper. Res. 57(6): 1483-1495 (2009) - [j9]David B. Brown, Melvyn Sim:
Satisficing Measures for Analysis of Risky Positions. Manag. Sci. 55(1): 71-84 (2009) - 2007
- [j8]David B. Brown:
Large deviations bounds for estimating conditional value-at-risk. Oper. Res. Lett. 35(6): 722-730 (2007) - [j7]Dimitris Bertsimas, David B. Brown:
Constrained Stochastic LQC: A Tractable Approach. IEEE Trans. Autom. Control. 52(10): 1826-1841 (2007) - 1992
- [j6]Kai-Hsiung Chang, James H. Cross, W. Homer Carlisle, David B. Brown:
A framework for intelligent test data generation. J. Intell. Robotic Syst. 5(2): 147-165 (1992) - 1991
- [j5]James H. Cross, Kai-Hsiung Chang, W. Homer Carlisle, David B. Brown:
Expert System Assisted Test Data Generation for Software Branch Coverage. Data Knowl. Eng. 6: 279-295 (1991) - [j4]William H. Deason, David B. Brown, Kai-Hsiung Chang, James H. Cross:
A Rule-Based Software Test Data Generator. IEEE Trans. Knowl. Data Eng. 3(1): 108-117 (1991) - 1989
- [j3]David B. Brown, Hooshang Hemami, Yorgo Istefanopulos:
On-line exploration of an unknown surface by a robotic probe. J. Field Robotics 6(5): 521-543 (1989) - [j2]David B. Brown, Saeed Maghsoodloo, William H. Deason:
A Cost Model for Determining the Optimal Number of Software Test Cases. IEEE Trans. Software Eng. 15(2): 218-221 (1989) - 1987
- [j1]David B. Brown:
Competition of Cellular Automata Rules. Complex Syst. 1(1) (1987)
Conference and Workshop Papers
- 2019
- [c3]Santiago R. Balseiro, David B. Brown, Chen Chen:
Dynamic Pricing of Relocating Resources in Large Networks: Extended Abstract. SIGMETRICS (Abstracts) 2019: 29-30 - 1991
- [c2]Kai-Hsiung Chang, W. Homer Carlisle, James H. Cross II, David B. Brown:
A heuristic approach for test case generation. ACM Conference on Computer Science 1991: 174-180 - 1989
- [c1]Kai-Hsiung Chang, James H. Cross II, W. Homer Carlisle, David B. Brown:
An Intelligent Test Data Generator for Software Branch Coverage. SEKE 1989: 13-18
Informal and Other Publications
- 2010
- [i1]Dimitris Bertsimas, David B. Brown, Constantine Caramanis:
Theory and Applications of Robust Optimization. CoRR abs/1010.5445 (2010)
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-10-04 20:03 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:
