Similar Search Results

Use of representative operation counts in computational testings of algorithms

Ahuja, Ravindra K.; Orlin, James B. - Sloan School of Management, Massachusetts Institute of … - 1992

Includes bibliographical references (p. 25-26).

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

Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems

Safer, Hershel M.; Orlin, James B. - Sloan School of Management, Massachusetts Institute of … - 1995

Includes bibliographical references (p. 40-42).

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

On a "primal" matroid intersection algorithm

Orlin, James B.; VandeVate, John. - Sloan School of Management, Massachusetts Institute of … - 1983

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

Some very easy knapsack/partition problems

Orlin, James B. - Sloan School of Management, Massachusetts Institute of … - 1983

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

A parametric worst case analysis for a machine scheduling problem

Mireault, Paul.; Vohra, Rakesh V.; Orlin, James B. - Sloan School of Management, Massachusetts Institute of … - 1993

Includes bibliographical references (p. 16).

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

Approximate Local Search in Combinatorial Optimization

Orlin, James B.; Punnen, Abraham P.; Schulz, Andreas S. - Sloan School of Management, Massachusetts Institute of … - 2003

Local search algorithms for combinatorial optimization problems are in general of pseudopolynomial running time and polynomial-time algorithms are often not known for finding locally optimal solutions for NP-hard optimization problems. We introduce the concept of epsilon-local optimality and...

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

QuickMatch--a very fast algorithm for the assignment problem

Orlin, James B.; Lee, Yusin. - Sloan School of Management, Massachusetts Institute of … - 1993

Includes bibliographical references (p. 25-27).

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

Parallel algorithms for the assignment and minimum-cost flow problems

Orlin, James B.; Stein, Clifford. - Sloan School of Management, Massachusetts Institute of … - 1992

Includes bibliographical references (p. 8-9).

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

A capacity scaling algorithm for the constrained maximum flow problem

Ahuja, Ravindra K.; Kanpur, I. I. T.; Orlin, James B. - Sloan School of Management, Massachusetts Institute of … - 1993

Includes bibliographical references (p. 19-20).

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

A fast algorithm for the bipartite node weighted matching problmem on path graphics with application to the inverse spanning tree problem

Ahuja, Ravindra K.; Orlin, James B. - Sloan School of Management, Massachusetts Institute of … - 1998

"(Revised February 14, 1998.)"--T.p. -- "February 1998"--Cover.

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