The following pages link to Ralph E. Gomory (Q537594):
Displaying 25 items.
- (Q323201) (redirect page) (← links)
- Origin and early evolution of corner polyhedra (Q323202) (← links)
- The atoms of integer programming (Q537595) (← links)
- (Q766597) (redirect page) (← links)
- A study of trajectories which tend to a limit cycle in three-space (Q766599) (← links)
- Trajectories tending to a critical point in 3-space (Q766905) (← links)
- A Ricardo model with economies of scale (Q1327373) (← links)
- Corner polyhedra and their connection with cutting planes (Q1424273) (← links)
- T-space and cutting planes (Q1424274) (← links)
- Cyclic group and knapsack facets (Q1424275) (← links)
- Some polyhedra related to combinatorial problems (Q2535821) (← links)
- (Q3233444) (← links)
- Outline of an algorithm for integer solutions to linear programs (Q3256638) (← links)
- Integer Programming and Pricing (Q3272914) (← links)
- (Q3274590) (← links)
- A Linear Programming Approach to the Cutting-Stock Problem (Q3275357) (← links)
- A Linear Programming Approach to the Cutting Stock Problem—Part II (Q5328572) (← links)
- Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem (Q5331678) (← links)
- Multistage Cutting Stock Problems of Two and More Dimensions (Q5336847) (← links)
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS (Q5341335) (← links)
- The Theory and Computation of Knapsack Functions (Q5560786) (← links)
- FACES OF AN INTEGER POLYHEDRON (Q5610171) (← links)
- On the convergence of an integer‐programming process (Q5722700) (← links)
- A SOLVABLE CASE OF THE TRAVELING SALESMAN PROBLEM (Q5725691) (← links)
- Boundaries for the limit cycle of van der Pol’s equation (Q5805303) (← links)
