A Suggested Computation for Maximal Multi-Commodity Network Flows
From MaRDI portal
Publication:2778592
DOI10.1287/mnsc.5.1.97zbMath0995.90516OpenAlexW4231610975WikidataQ92387449 ScholiaQ92387449MaRDI QIDQ2778592
D. R. Fulkerson, L. R. Ford, Jr.
Publication date: 22 October 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.5.1.97
Related Items
Network design and dynamic routing under queueing demand, Large-scale optimization with the primal-dual column generation method, An analysis of the integrated lot-sizing and cutting-stock problem formulation, A branch-price-and-cut algorithm for the vehicle routing problem with time windows and multiple deliverymen, Descent direction algorithm with multicommodity flow problem for signal optimization and traffic assignment jointly, Algorithms for multiplayer multicommodity flow problems, A simplex-like method with bisection for linear programming1, The discrete time window assignment vehicle routing problem, On the dominant of the \(s\)-\(t\)-cut polytope: vertices, facets, and adjacency, Bin packing and cutting stock problems: mathematical models and exact algorithms, On the equivalence between the Node‐ARC and ARC‐Chain formulations for the multi‐commodity maximal flow problem, The optimal partitioning of networks, The value of information in stochastic maximum flow problems, A hybrid column generation with GRASP and path relinking for the network load balancing problem, A heuristic solution procedure for multicommodity integer flows, A stabilized structured Dantzig-Wolfe decomposition method, Optimal multicommodity network flows with resource allocation, A heuristic for the long-term electricity generation planning problem using the Bloom and Gallant formulation, An approach to the distributionally robust shortest path problem, On the Number of Iterations for Dantzig--Wolfe Optimization and Packing-Covering Approximation Algorithms, A prototype column generation strategy for the multiple container loading problem, Some problems in discrete optimization, On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage, An Exact Method for the Minimum Feedback Arc Set Problem, An exact algorithm for the service network design problem with hub capacity constraints, An augmenting‐flow algorithm for a class of node‐capacitated maximum flow problems, Avoiding unnecessary demerging and remerging of multi‐commodity integer flows, The multicommodity network flow model revised to include vehicle per time period and node constraints, The inverse maximum dynamic flow problem, A Stabilizing Algorithm for Finding Two Node-Disjoint Paths in Arbitrary Networks, Simple and fast algorithm for binary integer and online linear programming, Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries, On the robustness of potential-based flow networks, Uncertain minimum cost multicommodity flow problem, A partitioning algorithm for the multicommodity network flow problem, Determining the optimal flows in zero-time dynamic networks, On solving continuous-time dynamic network flows, Nash equilibria and the price of anarchy for flows over time, Unnamed Item, A survey on the continuous nonlinear resource allocation problem, Turning restriction design in traffic networks with a budget constraint, A Branch and Price algorithm for the \(k\)-splittable maximum flow problem, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Maximum concurrent flows and minimum cuts, The double pivot simplex method, Solving a class of stochastic mixed-integer programs with branch and price, Multicommodity network flows—A survey, Capacity and assortment planning under one-way supplier-driven substitution for pharmacy kiosks with low drug demand, Optimal design of a manpower system, A Structure Conveying Parallelizable Modeling Language for Mathematical Programming, Column generation based heuristic for learning classification trees, Crew pairing at Air France, Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem, Maximum-throughput dynamic network flows, An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem, Beiträge zur Dekomposition von linearen Programmen, Reoptimization procedures for bounded variable primal simplex network algorithms, An infeasible (exterior point) simplex algorithm for assignment problems, GMA: a Pareto optimal distributed resource-allocation algorithm, A heuristic for cumulative vehicle routing using column generation
