Some further results on minimum distribution cost flow problems

DOI10.1007/S10878-006-8211-9MaRDI QIDQ2479563zbMATH OpenOpenAlexFDO

Authors Haiyan Lu, Enyu Yao, Liqun Qi

Publication date 4 April 2008

Published in Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10878-006-8211-9

zbMATH Keywords

manufacturing network flowminimum cost network flownetwork simplex algorithmnetworks with side constraints

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Programming involving graphs or networks (90C35)

Recommendations

• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• A note on a generalized network flow model for manufacturing process
• The algorithm of maximum flow and minimum cost for manufacturing network
• A network simplex algorithm for simple manufacturing network model
• An efficient generalized network-simplex-based algorithm for manufacturing network flows

Cites work

• A hybrid algorithm for solving network flow problems with side constraints.
• Algorithms for the simple equal flow problem
• Creating advanced bases for large scale linear programs exploiting embedded network structure
• Detecting embedded networks in LP using GUB structures and independent set algorithms
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• Network simplex algorithm for the general equal flow problem.

Cited in

(11)

• A note on a generalized network flow model for manufacturing process
• A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
• A network simplex algorithm for simple manufacturing network model
• Maximum flows in generalized processing networks
• Path optimization for joint distribution of medical consumables under hospital SPD supply chain mode
• A novel approach to subgraph selection with multiple weights on arcs
• A compaction scheme and generator for distribution networks
• Minimum cost problem of assembly network flows
• The algorithm of maximum flow and minimum cost for manufacturing network
• A specialized network simplex algorithm for the constrained maximum flow problem
• An efficient generalized network-simplex-based algorithm for manufacturing network flows

This page was built for publication: Some further results on minimum distribution cost flow problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2479563)