A Procedure for Determining a Family of Minimum-Cost Network Flow Patterns

doi 10.21236/ad0249662
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Defense Technical Information Center

Related search

A Procedure for Determining the Minimum Bulk Density of Soils

South African Journal of Plant and Soil
EcologyPlant ScienceSoil Science
2001English

A Generalized Minimum Cost Flow Model for Multiple Emergency Flow Routing

Mathematical Problems in Engineering
MathematicsEngineering
2014English

Minimum Cost Distributed Source Coding Over a Network

2007English

A Faster Strongly Polynomial Minimum Cost Flow Algorithm

1988English

A Polynomial Time Interior Point Algorithm for Minimum Cost Flow Problems

Journal of the Operations Research Society of Japan
Management ScienceDecision SciencesOperations Research
1990English

NETGEN: A Program for Generating Large Scale (UN)Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems

1973English

Road Network Patterns and the Minimum Length of a Circuit

Journal of Architecture, Planning and Environmental Engineering (Transactions of AIJ)
1986English

Solving Minimum Cost Multi-Commodity Network Flow Problem Using Lexicographic Goal Programming Approach

Journal of Applied Sciences and Environmental Management
2018English

Distributed Algorithms for Minimum Cost Multicast With Network Coding

IEEE/ACM Transactions on Networking
Electronic EngineeringComputer NetworksCommunicationsComputer Science ApplicationsElectricalSoftware
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy