default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert G. Jeroslow
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 1992
[j35]Robert G. Jeroslow, R. Kipp Martin, Ronald L. Rardin, Jinchang Wang:
Gainfree Leontief substitution flow problems. Math. Program. 57: 375-414 (1992)- 1990
- [j34]Robert G. Jeroslow, Jinchang Wang:
Solving Propositional Satisfiability Problems. Ann. Math. Artif. Intell. 1: 167-187 (1990) - [j33]Robert G. Jeroslow:
Two mixed integer programming formulations arising in manufacturing management. Discret. Appl. Math. 26(2-3): 137-157 (1990) - 1989
- [j32]Robert G. Jeroslow:
Representability of functions. Discret. Appl. Math. 23(2): 125-137 (1989) - [j31]Robert G. Jeroslow, Jinchang Wang:
Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base. INFORMS J. Comput. 1(1): 7-19 (1989) - 1988
- [j30]Robert G. Jeroslow:
Spatial imbeddings for linear and for logic structures. Decis. Support Syst. 4(1): 71-86 (1988) - [j29]Robert G. Jeroslow:
On monotone chaining procedures of the CF type. Decis. Support Syst. 4(2): 179-182 (1988) - [j28]Robert G. Jeroslow:
Computation-oriented reductions of predicate to propositional logic. Decis. Support Syst. 4(2): 183-197 (1988) - 1987
- [j27]Robert G. Jeroslow:
Representability in mixed integer programmiing, I: Characterization results. Discret. Appl. Math. 17(3): 223-243 (1987) - 1986
- [j26]Charles E. Blair, Robert G. Jeroslow, James K. Lowe:
Some results and experiments in programming techniques for propositional logic. Comput. Oper. Res. 13(5): 633-645 (1986) - [j25]Charles E. Blair, Robert G. Jeroslow:
Computational Complexity of Some Problems in Parametric Discrete Programming. I. Math. Oper. Res. 11(2): 241-260 (1986) - 1985
- [j24]Charles E. Blair, Robert G. Jeroslow:
Constructive characterizations of the value function of a mixed-integer program II. Discret. Appl. Math. 10(3): 227-240 (1985) - [j23]Robert G. Jeroslow:
The polynomial hierarchy and a simple model for competitive analysis. Math. Program. 32(2): 146-164 (1985) - 1984
- [j22]Charles E. Blair, Robert G. Jeroslow:
Extensions of a theorem of Balas. Discret. Appl. Math. 9(1): 11-26 (1984) - [j21]Charles E. Blair, Robert G. Jeroslow:
Constructive characterizations of the value-function of a mixed-integer program I. Discret. Appl. Math. 9(3): 217-233 (1984) - 1983
- [j20]Robert G. Jeroslow:
Uniform duality in semi-infinite convex optimization. Math. Program. 27(2): 144-154 (1983) - 1982
- [j19]Charles E. Blair, Robert G. Jeroslow:
The value function of an integer program. Math. Program. 23(1): 237-273 (1982) - 1981
- [j18]Charles E. Blair, Robert G. Jeroslow:
An Exact Penalty Method for Mixed-Integer Programs. Math. Oper. Res. 6(1): 14-18 (1981) - 1979
- [j17]Charles E. Blair, Robert G. Jeroslow:
The value function of a mixed integer program: II. Discret. Math. 25(1): 7-19 (1979) - [j16]Robert G. Jeroslow:
Minimal inequalities. Math. Program. 17(1): 1-15 (1979) - 1978
- [j15]Robert G. Jeroslow:
Cutting-plane theory: Algebraic methods. Discret. Math. 23(2): 121-150 (1978) - [j14]Robert G. Jeroslow:
Some Basis Theorems for Integral Monoids. Math. Oper. Res. 3(2): 145-154 (1978) - 1977
- [j13]Charles E. Blair, Robert G. Jeroslow:
The value function of a mixed integer program: I. Discret. Math. 19(2): 121-138 (1977) - 1975
- [j12]Robert G. Jeroslow:
On defining sets of vertices of the hypercube by linear inequalities. Discret. Math. 11(2): 119-124 (1975) - [j11]Robert G. Jeroslow:
Experimental logics and Δinf2sup0- theories. J. Philos. Log. 4(4): 253-267 (1975) - [j10]Robert G. Jeroslow, T. H. C. Smith:
Experimental results on Hillier's linear search. Math. Program. 9(1): 371-376 (1975) - 1974
- [j9]Robert G. Jeroslow:
On algorithms for discrete problems. Discret. Math. 7(3-4): 273-280 (1974) - [j8]Robert G. Jeroslow:
Trivial integer programs unsolvable by branch-and-bound. Math. Program. 6(1): 105-109 (1974) - 1973
- [j7]Robert G. Jeroslow:
The simplex algorithm with the pivot rule of maximizing criterion improvement. Discret. Math. 4(4): 367-377 (1973) - [j6]Robert G. Jeroslow:
Linear programs dependent on a single parameter. Discret. Math. 6(2): 119-140 (1973) - [j5]Robert G. Jeroslow:
There Cannot be any Algorithm for Integer Programming with Quadratic Constraints. Oper. Res. 21(1): 221-224 (1973) - [j4]Robert G. Jeroslow:
Asymptotic Linear Programming. Oper. Res. 21(5): 1128-1141 (1973) - [j3]Robert G. Jeroslow:
Redundancies in the Hilbert-Bernays Derivability Conditions for Gödel's Second Incompleteness Theorem. J. Symb. Log. 38(3): 359-367 (1973) - 1971
- [j2]Robert G. Jeroslow:
Comments on Integer Hulls of Two Linear Constraints. Oper. Res. 19(4): 1061-1069 (1971) - 1967
- [j1]Kenneth O. Kortanek, Robert G. Jeroslow:
Letter to the Editor - A Note on Some Classical Methods in Constrained Optimization and Positively Bounded Jacobians. Oper. Res. 15(5): 964-969 (1967)
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:43 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:
