Lets Explore,

Cover of Finding Minimum-Cost Flows by Double Scaling

Finding Minimum-Cost Flows by Double Scaling

(Paperback)

Ravindra K Ahuja, Sloan School of Management,

Nabu Press (Publisher)

Published

2011

Reviews

0

History and Archaeology History

By: Ravindra K Ahuja, Sloan School of Management | Publisher: Nabu Press | Released: 27 Aug 2011

Ships within 12-14 days

Out Of Stock

₹992.00

₹1323.00

25% off

This is a reproduction of a book published before 1923. This book may have occasional imperfections such as missing or blurred pages, poor pictures, errant marks, etc. that were either part of the original artifact, or were introduced by the scanning process. We believe this work is culturally important, and despite the imperfections, have elected to bring it back into print as part of our continuing commitment to the preservation of printed works worldwide. We appreciate your understanding of the imperfections in the preservation process, and hope you enjoy this valuable book.

More books by Ravindra K Ahuja, Sloan School of Management

Cover of Finding Minimum-cost Flows by Double Scaling

Finding Minimum-cost Flows by Double Scaling

Ravindra K Ahuja

₹2601.0₹2549.0

Cover of A Fast and Simple Algorithm for the Maximum Flow Problem

A Fast and Simple Algorithm for the Maximum Flow Problem

Ravindra K Ahuja

₹2601.0₹2549.0

Cover of Improved Primal Simplex Algorithms for Shortest Path, Assignment and Minimum Cost Flow Problems

Improved Primal Simplex Algorithms for Shortest Path, Assignment and Minimum Cost Flow Problems

Ravindra K Ahuja

₹1520.0₹1125.0

Cover of Network Flows

Network Flows

Ravindra K Ahuja

Cover of Network Flows

Network Flows

Ravindra K Ahuja

Cover of Faster Algorithms for the Shortest Path Problem

Faster Algorithms for the Shortest Path Problem

Ravindra K Ahuja

Cover of Network Flows

Network Flows

Ravindra K Ahuja

Cover of Faster Algorithms for the Shortest Path Problem

Faster Algorithms for the Shortest Path Problem

Ravindra K Ahuja

Cover of Network Flows

Network Flows

Ravindra K Ahuja

Cover of Faster Algorithms for the Shortest Path Problem - Primary Source Edition

Faster Algorithms for the Shortest Path Problem - Primary Source Edition

Ravindra K Ahuja

₹1271.0₹1013.0

Cover of Network Flows

Network Flows

Ravindra K Ahuja

₹1954.0₹1867.0

Cover of Network Flows

Network Flows

Ravindra K Ahuja

Cover of Faster Algorithms for the Shortest Path Problem

Faster Algorithms for the Shortest Path Problem

Ravindra K Ahuja

Cover of Faster Algorithms for the Shortest Path Problem

Faster Algorithms for the Shortest Path Problem

Ravindra K Ahuja

Cover of A Fast and Simple Algorithm for the Maximum Flow Problem

A Fast and Simple Algorithm for the Maximum Flow Problem

Ravindra K Ahuja

Cover of Network Flows - Scholar's Choice Edition

Network Flows - Scholar's Choice Edition

Ravindra K Ahuja

₹1611.0₹1530.0

Cover of Faster Algorithms for the Shortest Path Problem

Faster Algorithms for the Shortest Path Problem

Ravindra K Ahuja

₹1230.25₹935.64

Cover of Network Flows

Network Flows

Ravindra K Ahuja

₹1614.05₹1528.4

Cover of A Fast and Simple Algorithm for the Maximum Flow Problem

A Fast and Simple Algorithm for the Maximum Flow Problem

Ravindra K Ahuja

Cover of Faster Algorithms for the Shortest Path Problem

Faster Algorithms for the Shortest Path Problem

Ravindra K Ahuja

Cover of Finding Minimum-cost Flows by Double Scaling

Finding Minimum-cost Flows by Double Scaling

Ravindra K Ahuja

Cover of Finding Minimum-Cost Flows by Double Scaling

Finding Minimum-Cost Flows by Double Scaling

Ravindra K Ahuja

₹1323.0₹992.0

Cover of Network Flows

Network Flows

Ravindra K Ahuja

Similar Products

Cover of Finding Minimum-cost Flows by Double Scaling

Finding Minimum-cost Flows by Double Scaling

Ravindra K Ahuja

₹2601.0₹2549.0

Cover of Finding Minimum-cost Flows by Double Scaling

Finding Minimum-cost Flows by Double Scaling

Ravindra K Ahuja

Cover of Finding Minimum-Cost Flows by Double Scaling

Finding Minimum-Cost Flows by Double Scaling

Ravindra K. Ahuja

Cover of Finding Minimum-Cost Flows by Double Scaling: August, 1988 (Classic Reprint)

Finding Minimum-Cost Flows by Double Scaling: August, 1988 (Classic Reprint)

Ravindra K. Ahuja

Cover of Improved Primal Simplex Algorithms for Shortest Path, Assignment and Minimum Cost Flow Problems

Improved Primal Simplex Algorithms for Shortest Path, Assignment and Minimum Cost Flow Problems

Ravindra K Ahuja

₹1520.0₹1125.0

Cover of Network Flows

Network Flows

Ravindra K Ahuja

₹1954.0₹1867.0

Cover of Network Flows

Network Flows

Ravindra K Ahuja

Cover of Network Flows

Network Flows

Ravindra K Ahuja

Vidya AI