Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization

DOI10.1007/s10479-024-05890-0zbMATH Open1544.90079MaRDI QIDQ6581392

Frédéric Maffray, Vincent Jost, Luc Libralesso, Florian Fontan, Khadija Hadj Salem

Publication date: 30 July 2024

Published in: Annals of Operations Research (Search for Journal in Brave)

zbMATH Keywords

schedulingcombinatorial optimizationgraph theorybinary matrix visualization

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Planar graphs; geometric and topological aspects of graph theory (05C10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Cites Work

• Unnamed Item
• How to survive while visiting a graph
• Sequencing n Jobs on Two Machines with Arbitrary Time Lags
• Obtaining a Triangular Matrix by Independent Row-Column Permutations
• Operations Research and Capacity Expansion Problems: A Survey
• The Complexity of Flowshop and Jobshop Scheduling
• Meeting the Challenges of Optimized Memory Management in Embedded Vision Systems Using Operations Research
• Scheduling

This page was built for publication: Triangle width problem: at the intersection of graph theory, scheduling, and matrix visualization