Similar Search Results

The origin-destination shortest path problem

Kodialam, Muralidharan S.; Orlin, James B. - Sloan School of Management, Massachusetts Institute of … - 1993

Includes bibliographical references (p. 34-35).

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

Fast infeasibility detection algorithms for dial-a-ride transit problems

Ahuja, Ravindra K.; Dial, Robert B.; 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/10005587428

A polynomial-time parametric simplex algorithm for the minimum cost network flow problem

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

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

Polynomial-time highest-gain augmenting path algorithms for the generalized circulation problem

Goldfarb, Donald.; Jin, Zhiying.; Orlin, James B. - Sloan School of Management, Massachusetts Institute of … - 1996

Includes bibliographical references (p. 15-16).

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

Exact and Heuristic Methods for the Weapon Target Assignment Problem

Ahuja, Ravindra K.; Kumar, Arvind; Jha, Krishna; Orlin, … - Sloan School of Management, Massachusetts Institute of … - 2004

The Weapon Target Assignment (WTA) problem is a fundamental problem arising in defense-related applications of operations research. This problem consists of optimally assigning n weapons to m targets so that the total expected survival value of the targets after all the engagements is minimum....

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