Properties of the satellite location polyhedron and its relation to the scheduling polyhedron
暂无分享,去创建一个
[1] Charles H. Reilly,et al. A heuristic approach to worst-case carrier-to-interference ratio maximization in satellite system synthesis , 1990 .
[2] Laurence A. Wolsey,et al. Integer and Combinatorial Optimization , 1988 .
[3] Koichi Nishimura,et al. Applications of Integer Programming to Radio Frequency Management , 1984 .
[4] Thomas M. Liebling,et al. Placement of Telecommunication Satellites in the Geostationary Orbit , 1989 .
[5] Charles H. Reilly,et al. Calculating solution-value bounds for a geostationary-satellite location problem , 1990 .
[6] Hanif D. Sherali,et al. Linear Programming and Network Flows , 1977 .
[7] Gary D. Scudder,et al. Sequencing with Earliness and Tardiness Penalties: A Review , 1990, Oper. Res..
[8] Amh Bert Gerards,et al. Polyhedral combinatorics in combinatorial optimization , 1987 .
[9] W. Szwarc. Single-machine scheduling to minimize absolute deviation of completion times from a common due date , 1989 .
[10] Charles H. Reilly,et al. A two‐phase procedure for allotting geostationary orbital locations to communications satellites , 1991 .
[11] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[12] Charles H. Reilly,et al. Application of heuristic satellite plan synthesis algorithms to requirements of the WARC-88 allotment plan , 1990 .
[13] Scott Cameron. The Solution of the Graph-Coloring Problem as a Set-Covering Problem , 1977, IEEE Transactions on Electromagnetic Compatibility.
[14] Jeffrey B. Sidney,et al. A synthesis algorithm for broadcasting satellite service , 1983 .
[15] Jørgen Tind,et al. Blocking and Antiblocking Polyhedra , 1979 .
[16] Martin E. Dyer,et al. Formulating the single machine sequencing problem with release dates as a mixed integer program , 1990, Discret. Appl. Math..
[17] Charles H. Reilly,et al. The role of service areas in the optimization of FSS orbital and frequency assignments , 1985 .
[18] Walter L. Morgan,et al. Communications Satellite Handbook , 1989 .
[19] R. Tyrrell Rockafellar,et al. Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.
[20] J. J. Kanet. Minimizing the average deviation of job completion times about a common due date , 1981 .
[21] Charles H. Reilly. A satellite system synthesis model for orbital arc allotment optimization , 1988, IEEE Trans. Commun..
[22] Charles H. Reilly,et al. Mathematical programming formulations for satellite synthesis , 1987 .
[23] E. Balas. On the facial structure of scheduling polyhedra , 1985 .
[24] Gérard Cornuéjols,et al. Some facets of the simple plant location polytope , 1982, Math. Program..
[25] Charles H. Reilly,et al. On orbital allotments for geostationary satellites , 1986 .
[26] Curt A. Levis,et al. Optimization of orbital assignment and specification of service areas in satellite communications , 1987 .
[27] Charles H. Reilly,et al. Engineering calculations for communications satellite systems planning , 1985 .