Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHerbert E. Scarf
Person information
- award (1983): John von Neumann Theory Prize
- award (1973): Frederick W. Lanchester Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j17]Herbert E. Scarf:
My introduction to top-trading cycles. Games Econ. Behav. 66(2): 630-631 (2009)- 2008
- [c4]Herbert E. Scarf:
The Elements of General Equilibrium Theory. WINE 2008: 18 - 2007
- [c3]Herbert E. Scarf:
My Favorite Simplicial Complex and Some of Its Applications. WINE 2007: 3 - 2006
- [j16]Herbert E. Scarf, Kevin M. Woods:
Neighborhood Complexes and Generating Functions for Affine Semigroups. Discret. Comput. Geom. 35(3): 385-403 (2006) - 2004
- [j15]Andrew J. Clark, Herbert E. Scarf:
Optimal Policies for a Multi-Echelon Inventory Problem. Manag. Sci. 50(12-Supplement): 1782-1790 (2004) - [j14]Herbert E. Scarf:
Comments on "Optimal Policies for a Multi-Echelon Inventory Problem". Manag. Sci. 50(12-Supplement): 1791-1793 (2004) - 2002
- [j13]Herbert E. Scarf:
Inventory Theory. Oper. Res. 50(1): 186-191 (2002)
1990 – 1999
- 1998
- [j12]Imre Bárány, Herbert E. Scarf:
Matrices with Identical Sets of Neighbors. Math. Oper. Res. 23(4): 863-873 (1998) - [j11]Imre Bárány, Herbert E. Scarf, David Shallcross:
The topological structure of maximal lattice free convex bodies: The general case. Math. Program. 80: 1-15 (1998) - 1997
- [j10]Herbert E. Scarf:
Test sets for integer programs. Math. Program. 79: 355-368 (1997) - 1995
- [c2]Imre Bárány, Herbert E. Scarf, David Shallcross:
The Topological Structure of Maximal Lattice Free Convex Bodies: The General Case. IPCO 1995: 244-251 - 1994
- [j9]Imre Bárány, Roger Howe, Herbert E. Scarf:
The complex of maximal lattice free simplices. Math. Program. 66: 273-281 (1994) - 1993
- [j8]William J. Cook, Thomas Rutherford, Herbert E. Scarf, David Shallcross:
An Implementation of the Generalized Basis Reduction Algorithm for Integer Programming. INFORMS J. Comput. 5(2): 206-212 (1993) - [j7]Herbert E. Scarf, David F. Shallcross:
The Frobenius Problem and Maximal Lattice Free Bodies. Math. Oper. Res. 18(3): 511-515 (1993) - [j6]Herbert E. Scarf, David F. Shallcross:
Shortest Integer Vectors. Math. Oper. Res. 18(3): 516-522 (1993) - [c1]Imre Bárány, Roger Howe, Herbert E. Scarf:
The complex of maximal lattice free simplices. IPCO 1993: 1-9 - 1992
- [j5]László Lovász, Herbert E. Scarf:
The Generalized Basis Reduction Algorithm. Math. Oper. Res. 17(3): 751-764 (1992) - 1990
- [j4]Herbert E. Scarf:
Mathematical Programming and Economic Theory. Oper. Res. 38(3): 377-385 (1990) - [j3]Ravi Kannan, László Lovász, Herbert E. Scarf:
The Shapes of Polyhedra. Math. Oper. Res. 15(2): 364-380 (1990)
1980 – 1989
- 1985
- [j2]Herbert E. Scarf:
Integral Polyhedra in Three Space. Math. Oper. Res. 10(3): 403-438 (1985)
1970 – 1979
- 1976
- [j1]B. Curtis Eaves, Herbert E. Scarf:
The Solution of Systems of Piecewise Linear Equations. Math. Oper. Res. 1(1): 1-27 (1976)
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:47 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:
