![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Dennis L. Bricker
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2017
- [j13]Dennis L. Bricker, Kenneth O. Kortanek:
Perfect Duality in Solving Geometric Programming Problems Under Uncertainty. J. Optim. Theory Appl. 173(3): 1055-1065 (2017)
2000 – 2009
- 2008
- [j12]Hansuk Sohn, Dennis L. Bricker:
Utilizing the Surrogate Dual Bound in Capacity Planning with Economies of Scale. Algorithmic Oper. Res. 3(1) (2008) - [j11]Hansuk Sohn
, John D. Lee
, Dennis L. Bricker, Joshua D. Hoffman:
A Dynamic Programming Algorithm for Scheduling In-Vehicle Messages. IEEE Trans. Intell. Transp. Syst. 9(2): 226-234 (2008) - 2004
- [j10]Yi-Chih Hsieh, Hansuk Sohn, Dennis L. Bricker:
Generating (n, 2) De Bruijn Sequences with Some Balance and Uniformity Properties. Ars Comb. 72 (2004) - [j9]Rakesh Kawatra, Dennis L. Bricker:
Design of a degree-constrained minimal spanning tree with unreliable links and node outage costs. Eur. J. Oper. Res. 156(1): 73-82 (2004) - 2002
- [j8]Jayant Rajgopal
, Dennis L. Bricker:
Solving Posynomial Geometric Programming Problems via Generalized Linear Programming. Comput. Optim. Appl. 21(1): 95-109 (2002) - [j7]Edward Yu-Hsien Lin, Dennis L. Bricker:
Connecting special ordered inequalities and transformation and reformulation technique in multiple choice programming. Comput. Oper. Res. 29(10): 1441-1446 (2002) - 2000
- [j6]Rakesh Kawatra, Dennis L. Bricker:
A multiperiod planning model for the capacitated minimal spanning tree problem. Eur. J. Oper. Res. 121(2): 412-419 (2000)
1990 – 1999
- 1997
- [j5]Dennis L. Bricker, Kenneth O. Kortanek, Lina Xu:
Maximum likelihood estimates with order restrictions on probabilities and odds ratios: A geometric programming approach. Adv. Decis. Sci. 1(1): 53-65 (1997) - 1996
- [j4]Yi-Chih Hsieh, Dennis L. Bricker:
New infeasible interior-point algorithm based on monomial method. Comput. Oper. Res. 23(7): 653-666 (1996) - [j3]Jae Chul Choi, Dennis L. Bricker:
Effectiveness of a geometric programming algorithm for optimization of machining economics models. Comput. Oper. Res. 23(10): 957-961 (1996) - 1991
- [j2]Tzvi Raz, Dennis L. Bricker:
Optimal and heuristic solutions to the variable inspection policy problem. Comput. Oper. Res. 18(1): 115-123 (1991) - 1990
- [c1]Edward Yu-Hsien Lin, Dennis L. Bricker:
Implementing the Recursive APL Code for Dynamic Programming. APL 1990: 239-250
1980 – 1989
- 1980
- [j1]Dennis L. Bricker:
Bounding a class of nonconvex linearly-constrained resource allocation problems via the surrogate dual. Math. Program. 18(1): 68-83 (1980)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint