![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
B. Curtis Eaves
Person information
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j31]B. Curtis Eaves, Uriel G. Rothblum:
Generating approximate parametric roots of parametric polynomials. Ann. Oper. Res. 241(1-2): 515-573 (2016) - 2014
- [j30]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) - [j29]B. Curtis Eaves, Uriel G. Rothblum:
An Exact Correspondence of Linear Problems and Randomizing Linear Algorithms. Math. Oper. Res. 39(3): 607-623 (2014)
2000 – 2009
- 2004
- [j28]B. Curtis Eaves, Peter W. Glynn, Uriel G. Rothblum:
The Mean Number-in-System Vector Range for Multiclass Queueing Networks. Math. Oper. Res. 29(1): 182-190 (2004) - 2001
- [j27]W. Matthew Carlyle, B. Curtis Eaves:
Underground Planning at Stillwater Mining Company. Interfaces 31(4): 50-60 (2001)
1990 – 1999
- 1999
- [j26]B. Curtis Eaves, Uriel G. Rothblum:
Arithmetic Continuation of Regular Roots of Formal Parametric Polynomial Systems. Comput. Optim. Appl. 12(1-3): 189-205 (1999) - 1998
- [j25]B. Curtis Eaves, Karl H. Schmedders:
A cellation of the Grassmann manifold. Math. Program. 83: 253-262 (1998) - 1996
- [j24]Donald J. Brown, Peter M. DeMarzo, B. Curtis Eaves:
Computing Zeros of Sections of Vector Bundles Using Homotopies and Relocalization. Math. Oper. Res. 21(1): 26-43 (1996) - 1995
- [j23]B. Curtis Eaves, Uriel G. Rothblum:
Linear Problems and Linear Algorithms. J. Symb. Comput. 20(2): 207-214 (1995) - 1994
- [j22]B. Curtis Eaves, Uriel G. Rothblum:
Formulation of linear problems and solution by a universal machine. Math. Program. 65: 263-309 (1994) - 1993
- [j21]B. Curtis Eaves, Uriel G. Rothblum:
A class of "onto" multifunctions. Math. Program. 61: 327-343 (1993) - [j20]B. Curtis Eaves:
Pivoting to normalize a basic matrix. Math. Program. 62: 553-556 (1993) - 1992
- [j19]B. Curtis Eaves, Uriel G. Rothblum:
Dines-Fourier-Motzkin quantifier elimination and an application of corresponding transfer principles over ordered fields. Math. Program. 53: 307-321 (1992) - 1991
- [j18]B. Curtis Eaves, Alan J. Hoffman, Hui Hu:
Linear programming with spheres and hemispheres of objective vectors. Math. Program. 51: 1-16 (1991) - 1990
- [j17]B. Curtis Eaves:
Deforming Subdivisions. Math. Program. 48: 359-367 (1990)
1980 – 1989
- 1989
- [j16]B. Curtis Eaves, Uriel G. Rothblum:
A Theory on Extending Algorithms for Parametric Problems. Math. Oper. Res. 14(3): 502-533 (1989) - 1988
- [j15]B. Curtis Eaves, Uriel G. Rothblum:
A Discrete Time Average Cost Flexible Manufacturing and Operator Scheduling Model Solved by Deconvexification Over Time. Oper. Res. 36(2): 242-257 (1988) - 1987
- [j14]Mark Broadie, B. Curtis Eaves:
A variable rate refining triangulation. Math. Program. 38(2): 161-202 (1987) - 1984
- [j13]B. Curtis Eaves, James A. Yorke:
Equivalence of Surface Density and Average Directional Density. Math. Oper. Res. 9(3): 363-375 (1984) - [j12]B. Curtis Eaves:
Permutation congruent transformations of the freudenthal triangulation with minimum surface density. Math. Program. 29(1): 77-99 (1984) - 1982
- [j11]B. Curtis Eaves, Robert M. Freund:
Optimal scaling of balls and polyhedra. Math. Program. 23(1): 138-147 (1982) - 1981
- [j10]B. Curtis Eaves, Carlton E. Lemke:
Equivalence of LCP and PLS. Math. Oper. Res. 6(4): 475-484 (1981)
1970 – 1979
- 1979
- [j9]Richard Asmuth, B. Curtis Eaves, Elmor L. Peterson:
Computing Economic Equilibria on Affine Networks with Lemke's Algorithm. Math. Oper. Res. 4(3): 209-214 (1979) - [j8]George B. Dantzig, B. Curtis Eaves, David Gale:
An algorithm for a piecewise linear model of trade and production with negative prices and bankruptcy. Math. Program. 16(1): 190-209 (1979) - 1978
- [j7]B. Curtis Eaves:
A finite procedure for determining if a quadratic form is bounded below on a closed polyhedral convex set. Math. Program. 14(1): 122-124 (1978) - 1976
- [j6]B. Curtis Eaves, Herbert E. Scarf:
The Solution of Systems of Piecewise Linear Equations. Math. Oper. Res. 1(1): 1-27 (1976) - 1973
- [j5]George B. Dantzig, B. Curtis Eaves:
Fourier-Motzkin Elimination and Its Dual. J. Comb. Theory A 14(3): 288-297 (1973) - 1972
- [j4]B. Curtis Eaves:
Homotopies for computation of fixed points. Math. Program. 3(1): 1-22 (1972) - [j3]B. Curtis Eaves, Romesh Saigal:
Homotopies for computation of fixed points on unbounded regions. Math. Program. 3(1): 225-237 (1972) - 1971
- [j2]B. Curtis Eaves:
On the basic theorem of complementarity. Math. Program. 1(1): 68-75 (1971)
1960 – 1969
- 1962
- [j1]B. Curtis Eaves:
Algorithm 130: Permute. Commun. ACM 5(11): 551 (1962)
Coauthor Index
![](https://dblp.org/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-06-10 20:31 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint