A heuristic solution procedure for multicommodity integer flows

DOI10.1016/0305-0548(94)00085-MzbMath0841.90062MaRDI QIDQ1905088

Yanyan Li

Publication date: 29 July 1996

Published in: Computers \& Operations Research (Search for Journal in Brave)

zbMATH Keywords

heuristicminimum cost flowparametric analysisequipment replacementmulticommodity maximal flow and minimum cost flow problemsmutual arc capacity restrictions

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Reliability, availability, maintenance, inspection in operations research (90B25) Deterministic network models in operations research (90B10)

Related Items (4)

Effective material flow at an assembly facility ⋮ Unnamed Item ⋮ Unnamed Item ⋮ An algorithm for the capacitated, multi-commodity multi-period facility location problem.

Cites Work

• Unnamed Item
• Unnamed Item
• On the planar integer two-flow problem
• The multiperiod assignment problem: A multicommodity network flow model and specialized branch and bound algorithm
• A Suggested Computation for Maximal Multi-Commodity Network Flows
• Decomposition Principle for Linear Programs
• On multicommodity flows in planar graphs
• A polynomially bounded algorithm for a singly constrained quadratic program
• Analyzing Multi-Commodity Distribution Networks Having Milling-in-Transit Features
• A Survey of Linear Cost Multicommodity Network Flows
• Multicommodity network flows—A survey
• The simplex method for integral multicommodity networks

This page was built for publication: A heuristic solution procedure for multicommodity integer flows