Flow constrained minimum cost flow problem

DOI10.1007/s12597-012-0069-2zbMath1256.90015OpenAlexW1981101278MaRDI QIDQ1937859

Sonia Singh

Publication date: 1 February 2013

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-012-0069-2

zbMATH Keywords

minimum cost flow problemnetwork flow variant

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Polynomial dual network simplex algorithms
• A two-commodity multistate flow network with capacity weight varying with edges, nodes and types of commodity
• Impact of extra flow in a transportation problem
• Finding minimum-cost flows by double scaling
• Solving to optimality the uncapacitated fixed-charge network flow problem
• Algorithms for a multi-level network optimization problem
• Solving a transportation problem with mixed constraints and a specified transportation flow
• Approximating the single source unsplittable min-cost flow problem
• Combinatorial algorithms for the minimum interval cost flow problem
• Optimal solution of the discrete cost multicommodity network design problem
• Algorithms for the Simple Equal Flow Problem
• On the simplex algorithm for networks and generalized networks
• Minimum cost flow with set-constraints
• An algorithm for solving fixed charge bi-criterion transportation problem with restricted flow
• “More(Same)-for-Less” Paradox In Minimal Cost Network Flow Problem
• A Faster Strongly Polynomial Minimum Cost Flow Algorithm
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems

This page was built for publication: Flow constrained minimum cost flow problem