A specialized network simplex algorithm for the constrained maximum flow problem
From MaRDI portal
Publication:531424
DOI10.1016/j.ejor.2010.10.018zbMath1210.90036OpenAlexW2051329268MaRDI QIDQ531424
Publication date: 29 April 2011
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2010.10.018
Programming involving graphs or networks (90C35) Linear programming (90C05) Deterministic network models in operations research (90B10)
Related Items
A capable neural network model for solving the maximum flow problem, A network simplex method for the budget-constrained minimum cost flow problem, A faster polynomial algorithm for the constrained maximum flow problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Modeling the satellite placement problem as a network flow problem with one side constraint
- A manufacturing supply chain optimization model for distilling process
- An efficient generalized network-simplex-based algorithm for manufacturing network flows
- A double scaling algorithm for the constrained maximum flow problem
- Solving embedded generalized network problems
- Network flow problems with one side constraint: A comparison of three solution methods
- Dynamic factorization in large-scale optimization
- A hybrid algorithm for solving network flow problems with side constraints.
- A network simplex algorithm for simple manufacturing network model
- Parametric programming and Lagrangian relaxation: The case of the network problem with a single side-constraint
- Some further results on minimum distribution cost flow problems
- Increasing the Capacity of a Network: The Parametric Budget Problem
- Manufacturing network flows: a generalized network flow model for manufacturing process modelling
- A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
- Maximal Flow Through a Network
- On cycling in the network simplex method
- Basis exchange characterizations for the simplex son algorithm for LP/embedded networks
- The simplex SON algorithm for LP/embedded network problems
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Solving Constrained Transportation Problems
- The factorization approach to large-scale linear programming
- A network simplex method
- Finding Equivalent Network Formulations for Constrained Network Problems
- A primal algorithm for solving a capacitated network flow problem with additional linear constraints
- The alternating basis algorithm for assignment problems
- A streamlined simplex approach to the singly constrained transportation problem
- Theoretical Properties of the Network Simplex Method
- Progress Made in Solving the Multicommodity Flow Problem
- Solving Multicommodity Flow Problems with a Primal Embedded Network Simplex Algorithm
- Solving the undirected multicommodity flow problem using a shortest path‐based pricing algorithm
- A capacity scaling algorithm for the constrained maximum flow problem
- On a capacity scaling algorithm for the constrained maximum flow problem
- A constrained maximum flow problem†
