127,414 research outputs found
Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems
No full text"November 1988."Includes bibliographical references (p. 24-26).Ravindra K. Ahyja and James B. Orlin
Use of representative operation counts in computational testings of algorithms
No full textIncludes bibliographical references (p. 25-26).Ravindra K. Ahuja, James B. Orlin
Solving the convex ordered set problem
No full textCover title.Includes bibliographical references (p. 22).by Ravindra K. Ahuja, James B. Orlin
Equivalence of primal and dual simplex algorithms for the maximum flow problem
No full textCover title.Includes bibliographical references (p. 12).Supported in part by the ONR. N00014-1-0099 Supported in part by a grant from the UPS Foundation.by Ravindra K. Ahuja, James B. Orlin
A greedy genetic algorithm for the quadratic assignment problem
No full textCover title.Includes bibliographical references (p. 22-24).Supported in part by ONR. N00014-94-1-0099 Supported in part by UPS.by Ravindra K. Ahuja, James B. Orlin, Ashish Tiwari
New neighborhood search structures for the capacitated minimum spanning tree problem
No full textCover title. "November, 1998."Includes bibliographical references (p. 24-25).by Ravindra K. Ahuja, James B. Orlin, Dushyant Sharma
New scaling algorithms for the assignment and minimum cycle mean problems
No full textBibliography: p. 24-27.James B. Orlin and Ravindra K. Ahuja
New scaling algorithms for the assignment for minimum cycle mean problems
No full textAlso issued as: Working paper (Sloan School of Management) ; WP 2019-88.Includes bibliographical references (p. 24-27).by James B. Orlin and Ravindra K. Ahuja
New polynomial-time cycle-canceling algorithms for minimum cost flows
No full textCover title.Includes bibliographical references (p. 18).Supported by a grant from the United Parcel Service and the Office of Naval Research. N00014-96-1-0051by P.T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin
Fast infeasibility detection algorithms for dial-a-ride transit problems
No full text"(Revised February 14, 1998.)"--T.p. -- "February 1998"--Cover.Includes bibliographical references (p. 18).Supported by a grant from the United Parcel Service and a contract from the Office of Naval Research. ONR N00014-96-1-0051by Ravindra K. Ahuja, Robert Dial, James B. Orlin
- …
