Network flows. Theory, algorithms, and applications.

zbMATH Open1201.90001MaRDI QIDQ3056948FDOQ3056948

Authors: Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin 

Publication date: 23 November 2010

Recommendations

• scientific article; zbMATH DE number 49483
• Network flow algorithms
• scientific article; zbMATH DE number 42283
• scientific article; zbMATH DE number 53116
• scientific article; zbMATH DE number 858902

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Deterministic network models in operations research (90B10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to operations research and mathematical programming (90-01)

Cited In (only showing first 100 items - show all)

• The minmax regret robust shortest path problem in a finite multi-scenario model
• Budget-constrained minimum cost flows
• Deciding probabilistic automata weak bisimulation: theory and practice
• Augmenting trail theorem for the maximum 1-2 matching problem
• The total adjustment cost problem: applications, models, and solution algorithms
• A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs
• A two-stage stochastic transportation problem with fixed handling costs and a priori selection of the distribution channels
• Equilibrium in multi-criteria transportation networks
• Decomposition and mean-field approach to mixed integer optimal compensation problems
• Parameter-free sampled fictitious play for solving deterministic dynamic programming problems
• Complexity of one packing optimization problem
• Reduction approaches for robust shortest path problems
• An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
• Explore stochastic instabilities of periodic points by transition path theory
• Fast and fine quickest path algorithm
• An integrated approach for earthwork allocation, sequencing and routing
• An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line
• A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies
• Branch-and-price algorithm for the resilient multi-level hop-constrained network design
• The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem
• The static bicycle relocation problem with demand intervals
• The robust spanning tree problem with interval data
• A solution to the random assignment problem on the full preference domain
• 2-layer right angle crossing drawings
• On-line supply chain scheduling problems with preemption
• Near-optimal solutions for the generalized max-controlled set problem
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
• Routing of uncertain traffic demands
• Modeling supplier selection and the use of option contracts for global supply chain design
• On column generation formulations for the RWA problem
• Approximation algorithms for the single allocation problem in hub-and-spoke networks and related metric labeling problems
• Procedures for resource leveling and net present value problems in project scheduling with general temporal and resource constraints
• On the flow cost lowering problem
• Lower and upper bounds for a capacitated plant location problem with multicommodity flow
• Minimum-weight cycle covers and their approximability
• A compromised large-scale neighborhood search heuristic for capacitated air cargo loading planning
• Labeling algorithms for multiple objective integer knapsack problems
• On the \(K\) shortest path trees problem
• Restricted reallocation of resources
• A primal-dual interior point method whose running time depends only on the constraint matrix
• The suffix tree of a tree and minimizing sequential transducers
• A divide-and-link algorithm for hierarchical clustering in networks
• A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
• A branch-and-cut procedure for the Udine course timetabling problem
• Resource assignment in high school timetabling
• On the computational behavior of a polynomial-time network flow algorithm
• Improved approximation algorithms for capacitated facility location problems
• Effective algorithms for a class of discrete valued optimal control problems
• Resource levelling for projects with schedule-dependent time windows
• Converting triangulations to quadrangulations
• Computational investigations of maximum flow algorithms
• Generalized spanning trees
• The construction of stable project baseline schedules
• An exact algorithm for the robust shortest path problem with interval data
• Mixed-integer linear programming for resource leveling problems
• A capacity scaling algorithm for convex cost submodular flows
• The firefighter problem with more than one firefighter on trees
• A fully dynamic algorithm for distributed shortest paths.
• A new algorithm for reoptimizing shortest paths when the arc costs change
• Solving bicriteria 0--1 knapsack problems using a labeling algorithm.
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• A new dual based procedure for the transportation problem
• Enumeration and interactive selection of efficient paths in a multiple criteria graph for scheduling an earth observing satellite
• Approximate controllability of network systems
• Simultaneous lotsizing and scheduling on parallel machines
• Robust multiobjective optimization with application to Internet routing
• Equilibrium network design of shared-vehicle systems
• A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
• GRASP with hybrid heuristic-subproblem optimization for the multi-level capacitated minimum spanning tree problem
• The transportation problem with exclusionary side constraints and two branch-and-bound algorithms
• Obtaining a good primal solution to the uncapacitated transportation problem
• A label-setting algorithm for finding a quickest path
• Decision support for the career field selection process at the US Air Force Academy
• Exact methods for the resource levelling problem
• An algorithm to solve the proportional network flow problem
• Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
• An approximation algorithm for a general class of parametric optimization problems
• A branch-and-cut algorithm for scheduling of projects with variable-intensity activities
• Bayesian incentive compatibility via matchings
• On budget-constrained flow improvement.
• Base station location and channel allocation in a cellular network with emergency coverage requirements
• Branch-and-price-and-cut for the multiple traveling repairman problem with distance constraints
• Restoring infrastructure systems: an integrated network design and scheduling (INDS) problem
• Nanonetworks: the graph theory framework for modeling nanoscale systems
• Modeling and solving the rooted distance-constrained minimum spanning tree problem
• Integrating restoration and scheduling decisions for disrupted interdependent infrastructure systems
• Computing Behavioral Relations for Probabilistic Concurrent Systems
• Formal languages for integer programming modeling of shift scheduling problems
• (Arc-)disjoint flows in networks
• Lot sizing with inventory gains
• Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints
• Using mixed-integer programming to solve power grid blackout problems
• Best routes selection in international intermodal networks
• Network design and flow problems with cross-arc costs
• Resource extension functions: properties, inversion, and generalization to segments
• A solvable case of image reconstruction in discrete tomography
• A survey on models and algorithms for discrete evacuation planning network problems
• Multicriteria scheduling
• Bidirectional \(A^*\) search on time-dependent road networks
• Complexity of column generation in network design with path-based survivability mechanisms

This page was built for publication: Network flows. Theory, algorithms, and applications.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3056948)