A primal algorithm for solving a capacitated network flow problem with additional linear constraints
From MaRDI portal
Publication:4138506
DOI10.1002/net.3230070105zbMath0363.90107OpenAlexW2169627377MaRDI QIDQ4138506
No author found.
Publication date: 1977
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230070105
Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Linear programming (90C05)
Related Items (18)
Dynamic factorization in large-scale optimization ⋮ On the equivalence of constrained and unconstrained flows ⋮ Modeling of building evacuation problems by network flows with side constraints ⋮ Network flow problems with one side constraint: A comparison of three solution methods ⋮ Multiple objective minimum cost flow problems: a review ⋮ A novel approach to subgraph selection with multiple weights on arcs ⋮ A branch‐and‐bound algorithm for representative integer efficient solutions in multiple objective network programming problems ⋮ Facility location models for planning a transatlantic communications network ⋮ A hybrid algorithm for solving network flow problems with side constraints. ⋮ Network reoptimization procedures for multiobjective network problems ⋮ A surrogate and Lagrangian approach to constrained network problems ⋮ A specialized network simplex algorithm for the constrained maximum flow problem ⋮ Finding integer efficient solutions for multiple objective network programming problems ⋮ Solution of constrained generalized transportation problems using the pivot and probe algorithm ⋮ Large-scale linear programming: Geometry, working bases and factorizations ⋮ The transportation problem with exclusionary side constraints and two branch-and-bound algorithms ⋮ Solving embedded generalized network problems ⋮ Facility location models for distribution planning
Cites Work
This page was built for publication: A primal algorithm for solving a capacitated network flow problem with additional linear constraints
