Optimal multiple interval assignments in frequency assignment and traffic phasing

DOI10.1016/0166-218X(92)90004-TzbMath0768.68175MaRDI QIDQ1208449

Arundhati Raychaudhuri

Publication date: 16 May 1993

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

zbMATH Keywords

linear programmingchordal graphmaximal cliquesfrequency assignmentefficient algorithmscompatibility graphoptimal multiple interval phasing numberstraffic phasingtransitively orientable graph

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

Generating the family of all traffic signal light cycles coordinated with pedestrian crosswalks ⋮ A rainbow about \(T\)-colorings for complete graphs ⋮ A tabu search algorithm for frequency assignment

Cites Work

• The ellipsoid method and its consequences in combinatorial optimization
• Incidence matrices and interval graphs
• OptimalI-Intersection assignments for graphs: A linear programming approach
• I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Optimal multiple interval assignments in frequency assignment and traffic phasing