Letter to the Editor - A Note on Some Classical Methods in Constrained Optimization and Positively Bounded Jacobians. - Kenneth O. Kortanek; Robert G. Jeroslow (Oper. Res., 1967)

Comments on Integer Hulls of Two Linear Constraints. - Robert G. Jeroslow (Oper. Res., 1971)

Linear programs dependent on a single parameter. - Robert G. Jeroslow (Discret. Math., 1973)

The simplex algorithm with the pivot rule of maximizing criterion improvement. - Robert G. Jeroslow (Discret. Math., 1973)

There Cannot be any Algorithm for Integer Programming with Quadratic Constraints. - Robert G. Jeroslow (Oper. Res., 1973)

Asymptotic Linear Programming. - Robert G. Jeroslow (Oper. Res., 1973)

Redundancies in the Hilbert-Bernays Derivability Conditions for Gödel's Second Incompleteness Theorem. - Robert G. Jeroslow (J. Symb. Log., 1973)

On algorithms for discrete problems. - Robert G. Jeroslow (Discret. Math., 1974)

Trivial integer programs unsolvable by branch-and-bound. - Robert G. Jeroslow (Math. Program., 1974)

On defining sets of vertices of the hypercube by linear inequalities. - Robert G. Jeroslow (Discret. Math., 1975)

Experimental logics and Δinf2sup0- theories. - Robert G. Jeroslow (J. Philos. Log., 1975)

Experimental results on Hillier's linear search. - Robert G. Jeroslow; T. H. C. Smith (Math. Program., 1975)

The value function of a mixed integer program: I. - Charles E. Blair; Robert G. Jeroslow (Discret. Math., 1977)

Cutting-plane theory: Algebraic methods. - Robert G. Jeroslow (Discret. Math., 1978)

Some Basis Theorems for Integral Monoids. - Robert G. Jeroslow (Math. Oper. Res., 1978)

The value function of a mixed integer program: II. - Charles E. Blair; Robert G. Jeroslow (Discret. Math., 1979)

Minimal inequalities. - Robert G. Jeroslow (Math. Program., 1979)

An Exact Penalty Method for Mixed-Integer Programs. - Charles E. Blair; Robert G. Jeroslow (Math. Oper. Res., 1981)

The value function of an integer program. - Charles E. Blair; Robert G. Jeroslow (Math. Program., 1982)

Uniform duality in semi-infinite convex optimization. - Robert G. Jeroslow (Math. Program., 1983)

Extensions of a theorem of Balas. - Charles E. Blair; Robert G. Jeroslow (Discret. Appl. Math., 1984)

Constructive characterizations of the value-function of a mixed-integer program I. - Charles E. Blair; Robert G. Jeroslow (Discret. Appl. Math., 1984)

Constructive characterizations of the value function of a mixed-integer program II. - Charles E. Blair; Robert G. Jeroslow (Discret. Appl. Math., 1985)

The polynomial hierarchy and a simple model for competitive analysis. - Robert G. Jeroslow (Math. Program., 1985)

Some results and experiments in programming techniques for propositional logic. - Charles E. Blair; Robert G. Jeroslow; James K. Lowe (Comput. Oper. Res., 1986)

Computational Complexity of Some Problems in Parametric Discrete Programming. I. - Charles E. Blair; Robert G. Jeroslow (Math. Oper. Res., 1986)

Representability in mixed integer programmiing, I: Characterization results. - Robert G. Jeroslow (Discret. Appl. Math., 1987)

Spatial imbeddings for linear and for logic structures. - Robert G. Jeroslow (Decis. Support Syst., 1988)

On monotone chaining procedures of the CF type. - Robert G. Jeroslow (Decis. Support Syst., 1988)

Computation-oriented reductions of predicate to propositional logic. - Robert G. Jeroslow (Decis. Support Syst., 1988)

Representability of functions. - Robert G. Jeroslow (Discret. Appl. Math., 1989)

Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base. - Robert G. Jeroslow; Jinchang Wang (INFORMS J. Comput., 1989)

Solving Propositional Satisfiability Problems. - Robert G. Jeroslow; Jinchang Wang (Ann. Math. Artif. Intell., 1990)

Two mixed integer programming formulations arising in manufacturing management. - Robert G. Jeroslow (Discret. Appl. Math., 1990)

Gainfree Leontief substitution flow problems. - Robert G. Jeroslow; R. Kipp Martin; Ronald L. Rardin; Jinchang Wang (Math. Program., 1992)