default search action
Earl R. Barnes
Person information
- affiliation: University at Buffalo, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j15]Andreea Popescu, Earl R. Barnes, Ellis L. Johnson, Pinar Keskinocak:
Bid Prices When Demand Is a Mix of Individual and Batch Bookings. Transp. Sci. 47(2): 198-213 (2013) - 2011
- [j14]Balaji Gopalakrishnan, Seunghyun Kong, Earl R. Barnes, Ellis L. Johnson, Joel S. Sokol:
A least-squares minimum-cost network flow algorithm. Ann. Oper. Res. 186(1): 119-140 (2011) - 2010
- [j13]Senay Solak, John-Paul Clarke, Ellis L. Johnson, Earl R. Barnes:
Optimization of R&D project portfolios under endogenous uncertainty. Eur. J. Oper. Res. 207(1): 420-433 (2010) - [j12]Adan Vela, Senay Solak, John-Paul Clarke, William E. Singhose, Earl R. Barnes, Ellis L. Johnson:
Near Real-Time Fuel-Optimal En Route Conflict Resolution. IEEE Trans. Intell. Transp. Syst. 11(4): 826-837 (2010)
2000 – 2009
- 2007
- [c4]Senay Solak, John-Paul Clarke, Ellis L. Johnson, Earl R. Barnes:
A Stochastic Programming Model with Decision Dependent Uncertainty Realizations for Technology Portfolio Management. OR 2007: 75-80 - [c3]Liling Ren, Dawei Chang, Senay Solak, John-Paul Clarke, Earl R. Barnes, Ellis L. Johnson:
Simulating air traffic blockage due to convective weather conditions. WSC 2007: 1897-1904 - 2005
- [j11]Dawn M. Strickland, Earl R. Barnes, Joel S. Sokol:
Optimal Protein Structure Alignment Using Maximum Cliques. Oper. Res. 53(3): 389-402 (2005) - [j10]Earl R. Barnes, Antônio Carlos Moretti:
Some results on centers of polytopes. Optim. Methods Softw. 20(1): 9-24 (2005) - 2002
- [j9]Earl R. Barnes, Victoria Chen, Balaji Gopalakrishnan, Ellis L. Johnson:
A least-squares primal-dual algorithm for solving linear programming problems. Oper. Res. Lett. 30(5): 289-294 (2002) - 2001
- [j8]Ileana Castillo, Earl R. Barnes:
Chaotic Behavior of the Affine Scaling Algorithm for Linear Programming. SIAM J. Optim. 11(3): 781-795 (2001)
1990 – 1999
- 1995
- [j7]Earl R. Barnes:
An Inequality for Probability Moments with Applications. SIAM J. Discret. Math. 8(3): 347-358 (1995) - 1992
- [j6]Earl R. Barnes, Alan J. Hoffman, Uriel G. Rothblum:
Optimal partitions having disjoint convex and conic hulls. Math. Program. 54: 69-86 (1992)
1980 – 1989
- 1988
- [j5]Vojin G. Oklobdzija, Earl R. Barnes:
On Implementing Addition in VLSI Technology. J. Parallel Distributed Comput. 5(6): 716-728 (1988) - [j4]Earl R. Barnes, Anthony Vannelli, James Q. Walker:
A New Heuristic for Partitioning the Nodes of a Graph. SIAM J. Discret. Math. 1(3): 299-305 (1988) - 1986
- [j3]Earl R. Barnes:
A variation on Karmarkar's algorithm for solving linear programming problems. Math. Program. 36(2): 174-182 (1986) - 1985
- [c2]Vojin G. Oklobdzija, Earl R. Barnes:
Some optimal schemes for ALU implementation in VLSI technology. IEEE Symposium on Computer Arithmetic 1985: 2-8 - 1982
- [c1]Earl R. Barnes:
A procedure for classifying patterns. ICASSP 1982: 839-842
1970 – 1979
- 1979
- [j2]Sik K. Leung-Yan-Cheong, Earl R. Barnes, Daniel U. Friedman:
On some properties of the undetected error probability of linear codes (Corresp.). IEEE Trans. Inf. Theory 25(1): 110-112 (1979) - 1974
- [j1]Earl R. Barnes:
B74-15 Iterative Methods for Nonlinear Optimization Problems. IEEE Trans. Computers 23(2): 218 (1974)
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-05-08 21:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint