Combinatorial Issues in Air Traffic Optimization

References

• Barahona F. On via minimization. IEEE Trans. Circuits Systems (1990a) 37 4 527 530 Crossref, Google Scholar
• Barahona F. , Korte B. , Lovasz L. , PrŽmel H. J. , Schrijver A. On some applications of the Chinese postman problem. Paths, Flows and VLSI-Layout (1990b) 9 (Springer Verlag, Berlin) 1 16 Google Scholar
• Barahona F. , Cook W. , Seymour P. D. Planar multicommodity flows max cut and the Chinese postman problem. Polyedral Combinatorics: Proc. DIMACS Workshop: June 12–16 1989 (1990c) 1 (American Mathematical Society, Providence, R.I.) 189 202 Google Scholar
• Chang M. S. , Wang F. H. Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs. Inf. Processing Lett. (1992) 43 293 295 Crossref, Google Scholar
• Ehrlich G. , Even S. , Tarjan R. Intersection graphs of curves in the plane. J. Comb. Theory B (1976) 21 8 20 Crossref, Google Scholar
• Fondacci R. , Goldschmidt O. , Letrouit V. Combinatorial Issues of Air Traffic Optimization (1996) . Technical report LICIT, ENTPE-INRETS, Lyon, France Google Scholar
• Frieze A. , Jerrum M. Improved approximation algorithms for max-k-cut and max bissection. Lect. Notes Comput. Sci. (1995) 920 1 13 Crossref, Google Scholar
• Goemans M. X. , Williamson D. P. 0.878-Approximation algorithms for MAXCUT and MAX2SAT. Proc. 26th Annual ACM Sympos. Theory of Comput., Montreal (1994) (ACM, New York) 422 431 Google Scholar
• Karp R. M. , Miller R. , Thatcher J. Reducibility among combinatorial problems. Complexity of Computer Computations (1972) (Plenum Press, New York) 85 103 Crossref, Google Scholar
• Kratochvíl J. , Nesetril J. Independent set and clique problems in intersection-defined classes of graphs. Comment. Math. University Carolinae (1990) 31 1 85 93 Google Scholar
• Kuo Y. S. , Chern T. C. , Shih W. Fast algorithms for optimal layer assignement. Proc. 25th ACM/IEEE Design Automation Conf. (1988) (IEEE Computer Society DATC, Washington, D.C.) 554 559 Crossref, Google Scholar
• Lipton R. J. , Tarjan R. E. Applications of a planar separator theorem. SIAM J. Comput. (1980) 9 615 627 Crossref, Google Scholar
• Pinter R. Optimal layer assignment for interconnect. J. VLSI Comput. Systems (1984) 1 2 123 137 Google Scholar
• Spinrad J. On comparability and permutation graphs. SIAM J. Comput. (1985) 14 3 658 670 Crossref, Google Scholar
• Vitanyi P. M. How well can a graph be n-colored? Discrete Math. (1981) 34 69 80 Crossref, Google Scholar