Network flows

Network flows

Show other versions (1)

"August 1988. Revised: December, 1988."

Bibliographic Details
Main Authors:	Ahuja, Ravindra K., Magnanti, Thomas L., Orlin, James B.
Other Authors:	Sloan School of Management.
Format:	Working Paper
Published:	Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology 2009
Online Access:	http://hdl.handle.net/1721.1/49424

Similar Items

Network Flows
by: Ahuja, Ravindra K., 1956-, et al.
Published: (2004)

Some Recent Advances in Network Flows
by: Ahuja, Ravindra K., 1956-, et al.
Published: (2004)

A fast and simple algorithm for the maximum flow problem
by: Ahuja, Ravindra K., et al.
Published: (2009)

A fast and simple algorithm for the maximum flow problem
by: Ahuja, Ravindra K., et al.
Published: (2009)

Improved primal simplex algorithms for shortest path, assignment and minimum cost flow problems
by: Ahuja, Ravindra K., et al.
Published: (2009)

Improved time bounds for the maximum flow problem
by: Ahuja, Ravindra K., et al.
Published: (2009)

Improved time bounds for the maximum flow problem
by: Ahuja, Ravindra K., et al.
Published: (2009)

Inverse spanning tree problems : formulations and algorithms
by: Sokkalingam, P. T., et al.
Published: (2009)

Exact and Heuristic Methods for the Weapon Target Assignment Problem
by: Ahuja, Ravindra, et al.
Published: (2004)

VERY LARGE-SCALE NEIGHBORHOOD SEARCH FOR THE QUADRATIC ASSIGNMENT PROBLEM
by: Ahuja, Ravindra, et al.
Published: (2003)

DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS
by: Ahuja, Ravindra, et al.
Published: (2003)

Finding minimum-cost flows by double scaling
by: Ahuja, Ravindra K.
Published: (2009)

Exact and Heuristic Methods for the Weapon Target Assignment Problem
by: Ahuja, Ravindra K., et al.
Published: (2004)

Parametric Linear Programming and Anti-Cycling Pivoting Rules
by: Magnanti, Thomas L., et al.
Published: (2004)

SOLVING REAL-LIFE LOCOMOTIVE SCHEDULING PROBLEMS
by: Ahuja, Ravindra, et al.
Published: (2003)

A Very Large-Scale Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model
by: Ahuja, Ravindra, et al.
Published: (2003)

Network Flow Models for Designing Diameter-Constrained Minimum Spanning and Steiner Trees
by: Gouveia, Luis, et al.
Published: (2004)

A characterization of irreducible infeasible subsystems in flow networks
by: Joormann, Imke, et al.
Published: (2017)

Max flows in O(nm) time, or better
by: Orlin, James B
Published: (2014)

Genuinely polynomial simplex and non-simplex algorithms for the minimum cost flow problem
by: Orlin, James B.
Published: (2009)

Faster algorithms for the shortest path problem
by: Ahuja, Ravindra K.
Published: (2009)

A scaling algorithm for multicommodity flow problems
by: Schneur, Rina., et al.
Published: (2009)

A fast maximum flow algorithm
by: Orlin, James B, et al.
Published: (2021)

Strong Formulations for Network Design Problems with Connectivity Requirements
by: Magnanti, Thomas L., et al.
Published: (2004)

15.082J / 6.855J Network Optimization, Spring 2003
by: Orlin, James
Published: (2003)

Shortest Paths, Network Design and Associated Polyhedra
by: Magnanti, Thomas L., et al.
Published: (2004)

Designing Hierarchical Survivable Networks
by: Balakrishnan, Anantaram, et al.
Published: (2004)

The Multi-Network Design Problem
by: Balakrishnan, Anantaram, et al.
Published: (2004)

Randomized algorithms for finding the shortest negative cost cycle in networks
by: Orlin, James B, et al.
Published: (2020)

Designing Satellite Communication Networks by Zero-One Quadratic Programming
by: Helme, Marcia P., et al.
Published: (2004)

Modeling and Solving the Capacitated Network Loading Problem
by: Magnanti, Thomas L., et al.
Published: (2004)

On the power of randomization in network interdiction
by: Bertsimas, Dimitris J, et al.
Published: (2018)

Heuristics, LPs, and Trees on Trees: Network Design Analyses
by: Balakrishnan, Anantaram, et al.
Published: (2004)

Polynomial dual network simplex algorithms
by: Orlin, James B., et al.
Published: (2009)

A Dual-Based Algorithm for Multi-Level Network Design
by: Balakrishnan, Anantaram, et al.
Published: (2004)

The Convex Hull of Two Core Capacitated Network Design Problems
by: Magnanti, Thomas L., et al.
Published: (2004)

Doubling or Splitting: Strategies for Modeling and Analyzing Survivable Network Design Problems
by: Balakrishnan, Anantaram, et al.
Published: (2004)

A Dual Ascent Procedure for Large Scale Uncapacitated Network Design
by: Balakrishnan, Anantaram, et al.
Published: (2004)

Fenchel and Lagrange Duality are Equivalent
by: Magnanti, Thomas L.
Published: (2004)

A Linear Approximation Approach to Duality in Nonlinear Programming
by: Magnanti, Thomas L.
Published: (2004)