Optimal multiple interval assignments in frequency assignment and traffic phasing
From MaRDI portal
(Redirected from Publication:1208449)
Recommendations
- Chromatic scheduling and frequency assignment
- Phasing of traffic lights at a road junction
- Improving heuristics for the frequency assignment problem
- Description and generation of all minimal colorings of an interval graph, and the solution of related problems.
- Frequency assignment in cellular phone networks
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3737705 (Why is no real title available?)
- scientific article; zbMATH DE number 3746983 (Why is no real title available?)
- scientific article; zbMATH DE number 3225808 (Why is no real title available?)
- I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications
- Incidence matrices and interval graphs
- OptimalI-Intersection assignments for graphs: A linear programming approach
- The ellipsoid method and its consequences in combinatorial optimization
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(5)- A rainbow about T-colorings for complete graphs
- A tabu search algorithm for frequency assignment
- Generating the family of all traffic signal light cycles coordinated with pedestrian crosswalks
- Phasing of traffic lights at a road junction
- Application of circular coloring on optimum design of traffic signal phase
This page was built for publication: Optimal multiple interval assignments in frequency assignment and traffic phasing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1208449)