Robert G. Jeroslow

According to our database1, Robert G. Jeroslow authored at least 35 papers between 1967 and 1992.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

1992
Gainfree Leontief substitution flow problems.
Math. Program., 1992

1990
Two mixed integer programming formulations arising in manufacturing management.
Discret. Appl. Math., 1990

Solving Propositional Satisfiability Problems.
Ann. Math. Artif. Intell., 1990

1989
Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base.
INFORMS J. Comput., 1989

Representability of functions.
Discret. Appl. Math., 1989

1988
Computation-oriented reductions of predicate to propositional logic.
Decis. Support Syst., 1988

On monotone chaining procedures of the CF type.
Decis. Support Syst., 1988

Spatial imbeddings for linear and for logic structures.
Decis. Support Syst., 1988

1987
Representability in mixed integer programmiing, I: Characterization results.
Discret. Appl. Math., 1987

1986
Computational Complexity of Some Problems in Parametric Discrete Programming. I.
Math. Oper. Res., 1986

Some results and experiments in programming techniques for propositional logic.
Comput. Oper. Res., 1986

1985
The polynomial hierarchy and a simple model for competitive analysis.
Math. Program., 1985

Constructive characterizations of the value function of a mixed-integer program II.
Discret. Appl. Math., 1985

1984
Constructive characterizations of the value-function of a mixed-integer program I.
Discret. Appl. Math., 1984

Extensions of a theorem of Balas.
Discret. Appl. Math., 1984

1983
Uniform duality in semi-infinite convex optimization.
Math. Program., 1983

1982
The value function of an integer program.
Math. Program., 1982

1981
An Exact Penalty Method for Mixed-Integer Programs.
Math. Oper. Res., 1981

1979
Minimal inequalities.
Math. Program., 1979

The value function of a mixed integer program: II.
Discret. Math., 1979

1978
Some Basis Theorems for Integral Monoids.
Math. Oper. Res., 1978

Cutting-plane theory: Algebraic methods.
Discret. Math., 1978

1977
The value function of a mixed integer program: I.
Discret. Math., 1977

1975
Experimental results on Hillier's linear search.
Math. Program., 1975

Experimental logics and Δ<sub>inf2</sub><sup>sup0</sup>- theories.
J. Philos. Log., 1975

On defining sets of vertices of the hypercube by linear inequalities.
Discret. Math., 1975

1974
Trivial integer programs unsolvable by branch-and-bound.
Math. Program., 1974

On algorithms for discrete problems.
Discret. Math., 1974

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

Asymptotic Linear Programming.
Oper. Res., 1973

There Cannot be any Algorithm for Integer Programming with Quadratic Constraints.
Oper. Res., 1973

The simplex algorithm with the pivot rule of maximizing criterion improvement.
Discret. Math., 1973

Linear programs dependent on a single parameter.
Discret. Math., 1973

1971
Comments on Integer Hulls of Two Linear Constraints.
Oper. Res., 1971

1967
Letter to the Editor - A Note on Some Classical Methods in Constrained Optimization and Positively Bounded Jacobians.
Oper. Res., 1967


  Loading...