Network flows

Network flows

Mostrar outras versões (1)

"August 1988. Revised: December, 1988."

Detalhes bibliográficos
Principais autores:	Ahuja, Ravindra K., Magnanti, Thomas L., Orlin, James B.
Outros Autores:	Sloan School of Management.
Formato:	Working Paper
Publicado em:	Cambridge, Mass. : Alfred P. Sloan School of Management, Massachusetts Institute of Technology 2009
Acesso em linha:	http://hdl.handle.net/1721.1/49424

Registros relacionados

Network Flows
por: Ahuja, Ravindra K., 1956-, et al.
Publicado em: (2004)

Network flows : theory, algorithms, and applications /
por: 378088 Ahuja, Ravindra K., et al.
Publicado em: (1993)

Some Recent Advances in Network Flows
por: Ahuja, Ravindra K., 1956-, et al.
Publicado em: (2004)

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

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

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

Improved time bounds for the maximum flow problem
por: Ahuja, Ravindra K., et al.
Publicado em: (2009)

Improved time bounds for the maximum flow problem
por: Ahuja, Ravindra K., et al.
Publicado em: (2009)

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

Inverse spanning tree problems : formulations and algorithms
por: Sokkalingam, P. T., et al.
Publicado em: (2009)

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

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

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

DYNAMIC SHORTEST PATHS MINIMIZING TRAVEL TIMES AND COSTS
por: Ahuja, Ravindra, et al.
Publicado em: (2003)

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

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

SOLVING REAL-LIFE LOCOMOTIVE SCHEDULING PROBLEMS
por: Ahuja, Ravindra, et al.
Publicado em: (2003)

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

Max flows in O(nm) time, or better
por: Orlin, James B
Publicado em: (2014)

A characterization of irreducible infeasible subsystems in flow networks
por: Joormann, Imke, et al.
Publicado em: (2017)

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

A scaling algorithm for multicommodity flow problems
por: Schneur, Rina., et al.
Publicado em: (2009)

A fast maximum flow algorithm
por: Orlin, James B, et al.
Publicado em: (2021)

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

15.082J / 6.855J Network Optimization, Spring 2003
por: Orlin, James
Publicado em: (2003)

Shortest Paths, Network Design and Associated Polyhedra
por: Magnanti, Thomas L., et al.
Publicado em: (2004)

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

Designing Hierarchical Survivable Networks
por: Balakrishnan, Anantaram, et al.
Publicado em: (2004)

The Multi-Network Design Problem
por: Balakrishnan, Anantaram, et al.
Publicado em: (2004)

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

Modeling and Solving the Capacitated Network Loading Problem
por: Magnanti, Thomas L., et al.
Publicado em: (2004)

Heuristics, LPs, and Trees on Trees: Network Design Analyses
por: Balakrishnan, Anantaram, et al.
Publicado em: (2004)

Faster algorithms for the shortest path problem
por: Ahuja, Ravindra K.
Publicado em: (2009)

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

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

On the power of randomization in network interdiction
por: Bertsimas, Dimitris J, et al.
Publicado em: (2018)

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

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

Polynomial dual network simplex algorithms
por: Orlin, James B., et al.
Publicado em: (2009)

Fenchel and Lagrange Duality are Equivalent
por: Magnanti, Thomas L.
Publicado em: (2004)