A decomposition property of polyhedra

DOI10.1007/BF02591932zbMath0579.90049OpenAlexW1997323951MaRDI QIDQ3703640

Dominique de Werra

Publication date: 1984

Published in: Mathematical Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02591932

zbMATH Keywords

schedulingtotal unimodularityintegral polyhedronbalanced matricesparallel processors with preemptionsreal decomposition property

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Polytopes and polyhedra (52Bxx)

Related Items (4)

On the two-phase method for preemptive scheduling ⋮ Good and nice colorings of balanced hypergraphs ⋮ A note on SS/TDMA satellite communication ⋮ Preemptive scheduling with staircase and piecewise linear resource availability

Cites Work

• Integer Rounding for Polymatroid and Branching Optimization Problems
• On some characterisations of totally unimodular matrices
• On Preemptive Scheduling of Unrelated Parallel Processors by Linear Programming
• Integral decomposition in polyhedra
• Polynomial algorithms for a class of linear programs
• Balanced matrices
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A decomposition property of polyhedra