Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm

DOI10.1287/IJOC.9.2.154MaRDI QIDQ4354936zbMATH OpenOpenAlexFDO

Authors John W. Mamer, Richard D. McBride

Publication date 22 April 1998

Published in INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/ijoc.9.2.154

zbMATH Keywords

embedded network simplex algorithmlarge multicommodity flow

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Recommendations

• A Network-Based Primal-Dual Heuristic for the Solution of Multicommodity Network Flow Problems
• scientific article; zbMATH DE number 515936
• A simple method for improving the primal simplex method for the multicommodity flow problem
• Dual-ascent methods for large-scale multicommodity flow problems

Cited in

(17)

• A novel approach to subgraph selection with multiple weights on arcs
• PRIMAL-DUAL PROXIMAL POINT ALGORITHM FOR MULTICOMMODITY NETWORK FLOW PROBLEMS
• Multicommodity network flows: A survey. II: Solution methods
• Cycle‐based algorithms for multicommodity network flow problems with separable piecewise convex costs
• A specialized network simplex algorithm for the constrained maximum flow problem
• Bayesian knowledge base tuning
• Progress in the dual simplex method for large scale LP problems: Practical dual phase 1 algorithms
• A simple method for improving the primal simplex method for the multicommodity flow problem
• Simplex and Interior Point Specialized Algorithms for Solving Nonoriented Multicommodity Flow Problems
• New methods for multi-commodity flows
• A scaling algorithm for multicommodity flow problems
• The simplex algorithm for multicommodity networks
• Dual-ascent methods for large-scale multicommodity flow problems
• Advanced start for the multicommodity network flow problem
• Hyper-sparsity in the revised simplex method and how to exploit it
• Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm
• A Primal Partitioning Solution for the Arc-Chain Formulation of a Multicommodity Network Flow Problem

This page was built for publication: Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm

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