The flow circulation sharing problem
From MaRDI portal
Cites work
- An improved version of the out-of-kilter method and a comparative study of computer codes
- An Out-of-Kilter Method for Minimal-Cost Flow Problems
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3156381 (Why is no real title available?)
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 2166303 (Why is no real title available?)
- scientific article; zbMATH DE number 3303654 (Why is no real title available?)
- scientific article; zbMATH DE number 3400923 (Why is no real title available?)
- On Algorithms for Enumerating All Circuits of a Graph
- The Knapsack Sharing Problem
- The Sharing Problem
Cited in
(6)- Linear and combinatorial sharing problems
- A nonlinear minimax allocation problem with multiple knapsack constraints
- Reshipments and overshipments in transportation problems with minimax objective
- The balanced linear programming problem
- Optimality conditions for distributive justice
- Solving knapsack sharing problems with general tradeoff functions
This page was built for publication: The flow circulation sharing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4745580)