Jeremy F. Shapiro

According to our database1, Jeremy F. Shapiro authored at least 15 papers between 1967 and 2004.

Collaborative distances:
  • Dijkstra number2 of six.
  • Erdős number3 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2004
Challenges of strategic supply chain planning and modeling.
Comput. Chem. Eng., 2004

2001
Modeling and IT Perspectives on Supply Chain Integration.
Inf. Syst. Frontiers, 2001

1999
On the connections among activity-based costing, mathematical programming models for analyzing strategic decisions, and the resource-based view of the firm.
Eur. J. Oper. Res., 1999

1993
Chapter 8 Mathematical programming models and methods for production planning and scheduling.
Proceedings of the Logistics of Production and Inventory, 1993

1991
Convergent duality for the traveling salesman problem.
Oper. Res. Lett., 1991

1984
A note on node aggregation and Benders' decomposition.
Math. Program., 1984

1982
A Hybrid Decomposition Method for Integrating Coal Supply and Demand Models.
Oper. Res., 1982

1977
A note on the primal-dual and out-of-kilter algorithms for network optimization problems.
Networks, 1977

A Convergent Duality Theory for Integer Programming.
Oper. Res., 1977

1975
Or models for energy planning.
Comput. Oper. Res., 1975

1973
Computational experience with a group theoretic integer programming algorithm.
Math. Program., 1973

1971
Generalized Lagrange Multipliers in Integer Programming.
Oper. Res., 1971

1970
Turnpike Theorems for Integer Programming Problems.
Oper. Res., 1970

1968
Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm.
Oper. Res., 1968

1967
A Finite Renewal Algorithm for the Knapsack and Turnpike Models.
Oper. Res., 1967


  Loading...