“Every crease is a story.”
Author
We don’t have a biography for James B. Orlin yet. Their books are below, most-read first.
Bibliographic data from Open Library.
Most-read first
Polynomial Dual Network Simplex Algorithms
James B. Orlin, Sloan School of Management & others, 2018
Genuinely Polynomial Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem
James B. Orlin & Sloan School of Management, 2018

A Fast and Simple Algorithm for the Maximum Flow Problem
Ravindra K. Ahuja, James B. Orlin & others, 2015
Network Flows : Pearson New International Edition
Ravindra K. Ahuja, Thomas L. Magnanti & others, 2013
This page currently brings together 4 catalogue works, including Polynomial Dual Network Simplex Algorithms, Genuinely Polynomial Simplex and Non-Simplex Algorithms for the Minimum Cost Flow Problem, A Fast and Simple Algorithm for the Maximum Flow Problem. This is a selection from our catalogue, not necessarily a complete bibliography. Open a work to compare editions and reviews.
Search this authorThe list uses catalogue reading-popularity data to put widely read works first. That is a discovery aid, not a claim that the first result is the author's best book or a recommended reading order.
Open the book's catalogue page and compare publisher, year, format, language and ISBN. Different editions of the same work can have different translators, introductions and page counts.