Search Results - person:"Pekny, J.F" - EconBiz

Economic risk management for chemical manufacturing supply chain planning

Applequist, George Einar - 2002

In managing economic risks, it is necessary for a company in the process industries to allow for uncertainties in the amount of each product that can be sold, how much material is available for production, as well as prices and costs. The goal is to optimize a company's profit criterion without...

Persistent link: https://www.econbiz.de/10009430526

Supply chain optimisation and protocol environment (SCOPE) for rapid prototyping and analysis of complex supply chains

Orcun, S.; Asmundsson, J.M.; Uzsoy, R.; Clement, J.P.; … - In: Production planning & control : PPC 18 (2007) 5, pp. 388-406

Persistent link: https://www.econbiz.de/10007749590

Lower bounds for nonlinear assignment problems using many body interactions

Ramachandran, B.; Pekny, J.F. - In: European journal of operational research : EJOR 105 (1998) 1, pp. 202-215

Persistent link: https://www.econbiz.de/10006671593

Lower bounds for nonlinear assignment problems using many body interactions

Ramachandran, Bala; Pekny, J. F. - In: European Journal of Operational Research 105 (1998) 1, pp. 202-215

Persistent link: https://www.econbiz.de/10005158485

A branch-and-cut algorithm for vehicle routing problems

Araque, J.R.G.; Kudva, G.; Morin, T.L.; Pekny, J.F. - 1994

Persistent link: https://www.econbiz.de/10008224204

A distributed exact algorithm for the multiple resource constrained sequencing problem

Kudva, G.K.; Pekny, J.F. - 1993

Persistent link: https://www.econbiz.de/10008224750

An Exact Algorithm for Finding Undirectd Hamiltonian Cycles Based on a Two-Matching Problem Relaxation.

Miller, D.L.; Pekny, J.F; Thompson, G.L. - Carnegie Mellon University, Tepper School of Business - 1991

Persistent link: https://www.econbiz.de/10005102287

An Exact Two-Matching Based Branch and Bound Algorithm for the Symmetric Traveling Salesman Problem.

Miller, D.L.; Pekny, J.F.; Thompson, G.L. - Carnegie Mellon University, Tepper School of Business - 1991

Persistent link: https://www.econbiz.de/10005029129

Results from a parallel branch and bound algorithm for the asymmetric traveling salesman problem

Miller, D. L. - In: Operations research letters 8 (1989) 3, pp. 129-135

Persistent link: https://www.econbiz.de/10001067369

A SPARSE MATRIX TECHNIQUE FOR PARALLEL SOLUTION OF FULLY DENSE TRANSPORTATION PROBLEMS

MILLER, D.L.; PEKNY, J.F.; THOMPSON, G.L. - Carnegie Mellon University, Tepper School of Business - 1988

Persistent link: https://www.econbiz.de/10005029176

A service of the