The following pages link to Robert G. Jeroslow (Q1104855):
Displaying 50 items.
- (Q798259) (redirect page) (← links)
- Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
- Cluster sets of vector series (Q1061612) (← links)
- Constructive characterizations of the value function of a mixed-integer program. II (Q1062914) (← links)
- Extensions of a theorem of Balas (Q1075945) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- Some results and experiments in programming techniques for propositional logic (Q1100931) (← links)
- A simplification for some disjunctive formulations (Q1104856) (← links)
- A limiting Lagrangian for infinitely-constrained convex optimization in \(\mathbb{R}^n\) (Q1136349) (← links)
- Strengthening cuts for mixed integer programs (Q1142702) (← links)
- A limiting infisup theorem (Q1151826) (← links)
- Logic-based decision support. Mixed integer model formulation (Q1210858) (← links)
- On defining sets of vertices of the hypercube by linear inequalities (Q1214165) (← links)
- Experimental logics and \(\Delta^0_2\)-theories (Q1222647) (← links)
- A converse for disjunctive constraints (Q1238749) (← links)
- The value function of a mixed integer program: I (Q1241180) (← links)
- Representations of unbounded optimization problems as integer programs (Q1252154) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- The value function of a mixed integer program. II (Q1258688) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- (Q1356217) (redirect page) (← links)
- Solving propositional satisfiability problems (Q1356218) (← links)
- Gainfree Leontief substitution flow problems (Q1802953) (← links)
- Representability of functions (Q1825755) (← links)
- Linear programs dependent on a single parameter (Q1844587) (← links)
- On algorithms for discrete problems (Q2264621) (← links)
- The simplex algorithm with the pivot rule of maximizing criterion improvement (Q2558159) (← links)
- Modelling with integer variables (Q3217950) (← links)
- Uniform duality in semi-infinite convex optimization (Q3219365) (← links)
- (Q3321839) (← links)
- (Q3665778) (← links)
- Experimental Results on the New Techniques for Integer Programming Formulations (Q3680609) (← links)
- The polynomial hierarchy and a simple model for competitive analysis (Q3716806) (← links)
- Computational Complexity of Some Problems in Parametric Discrete Programming. I (Q3793961) (← links)
- (Q3873915) (← links)
- A Cutting-Plane Game for Facial Disjunctive Programs (Q3873916) (← links)
- Minimal inequalities (Q3879045) (← links)
- (Q3890410) (← links)
- Lagrangean functions and affine minorants (Q3895250) (← links)
- The value function of an integer program (Q3941194) (← links)
- An Exact Penalty Method for Mixed-Integer Programs (Q3960474) (← links)
- (Q3962788) (← links)
- Dynamic Programming, Integral Polyhedra and Horn Clause Knowledge Base (Q4018150) (← links)
- Experimental results on Hillier's linear search (Q4074674) (← links)
- (Q4081003) (← links)
- (Q4132247) (← links)
- Cutting-Planes for Complementarity Constraints (Q4178799) (← links)
- (Q4182257) (← links)
- Some Basis Theorems for Integral Monoids (Q4190435) (← links)
- (Q4191529) (← links)
