The problem of maximum flow with minimum attainable cost in a network

DOI10.1007/s12597-012-0106-1zbMath1353.90029OpenAlexW1985635003MaRDI QIDQ505156

S. Purusotham, Nazimuddin Ahmed, Shila Das

Publication date: 19 January 2017

Published in: Opsearch (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s12597-012-0106-1

zbMATH Keywords

distance and capacity matrixlexicographic search approach and algorithm

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new approach for solving the network problems
• A travelling salesman problem (TSP) with multiple job facilities.
• Maximal Flow Through a Network
• On a routing problem
• Solutions of the Shortest-Route Problem—A Review
• An Out-of-Kilter Method for Minimal-Cost Flow Problems
• Discrete-Variable Extremum Problems
• The Routing Problem with “K” Specified Nodes
• A Primal Method for Minimal Cost Flows with Applications to the Assignment and Transportation Problems
• The Loading Problem

This page was built for publication: The problem of maximum flow with minimum attainable cost in a network