Balancing problems in acyclic networks

DOI10.1016/0166-218X(94)90202-XzbMath0811.90108WikidataQ59560968 ScholiaQ59560968MaRDI QIDQ1327220

Peter L. Hammer, Ron Shamir, Mark E. Hartmann, Endre Boros

Publication date: 15 June 1994

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

balancing problem in acyclic networksbuffer assignment

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Deterministic network models in operations research (90B10) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35)

Related Items (4)

Topological additive numbering of directed acyclic graphs ⋮ On cardinality constrained cycle and path polytopes ⋮ Facets of the \(p\)-cycle polytope ⋮ Finding minimum cost to time ratio cycles with small integral transit times

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Linear and combinatorial optimization in ordered algebraic structures
• Finding minimum cost to time ratio cycles with small integral transit times
• Critical-Path Planning and Scheduling: Mathematical Basis
• Computing optimal scalings by parametric network algorithms
• Cyclic Scheduling via Integer Programs with Circular Ones
• Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Fibonacci heaps and their uses in improved network optimization algorithms
• A polynomial algorithm for balancing acyclic data flow graphs
• Faster parametric shortest path and minimum‐balance algorithms

This page was built for publication: Balancing problems in acyclic networks