A compaction scheme and generator for distribution networks

DOI10.3934/jimo.2016.12.117zbMath1317.90068OpenAlexW2317625345MaRDI QIDQ2515272

I-Lin Wang, Ju-Chun Lin

Publication date: 31 July 2015

Published in: Journal of Industrial and Management Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/jimo.2016.12.117

zbMATH Keywords

network optimizationdistribution networkcompaction schemenetwork generatorproportional flow constraint

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Graph algorithms (graph-theoretic aspects) (05C85) Flows in graphs (05C21)

Uses Software

• DIMACS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Heuristic factory planning algorithm for advanced planning and scheduling
• On implementing the push-relabel method for the maximum flow problem
• A network simplex based algorithm for the minimum cost proportional flow problem with disconnected subnetworks
• A network simplex algorithm for solving the minimum distribution cost problem
• Maximum flow problem in the distribution network
• Some further results on minimum distribution cost flow problems
• Manufacturing network flows: a generalized network flow model for manufacturing process modelling
• A Primal Simplex Approach to Pure Processing Networks
• NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
• An improved primal simplex variant for pure processing networks
• Models for Effective Deployment and Redistribution of Bicycles Within Public Bicycle-Sharing Systems

This page was built for publication: A compaction scheme and generator for distribution networks