A simulation-based scheduling mechanism for photoreconnaissance satellite is presented in this paper. The satellite scheduling problem belongs to a class of singlemachine scheduling problems with time window constraint. It is NP-hard in computational complexity. Based on simulation platform, a mixed integer programming model is used to formulate the problem and an advanced tabu algorithm is ado...

a one-sided ideal of a ring has the insertion of factors property (or simply, ifp) if implies r for . we say a one-sided ideal of has the weakly ifp if for each , implies , for some non-negative integer . we give some examples of ideals which have the weakly ifp but have not the ifp. connections between ideals of which have the ifp and related ideals of some ring extensions are also shown.

Recently Andersen et al. [1], Borozan and Cornuéjols [6] and Cornuéjols and Margot [10] have characterized the extreme valid inequalities of a mixed integer set consisting of two equations with two free integer variables and non-negative continuous variables. These inequalities are either split cuts or intersection cuts derived using maximal lattice-free convex sets. In order to use these inequ...

Cyclic timetabling for public transportation companies is usually modeled by the periodic event scheduling problem. To deduce a mixed-integer programming formulation, artificial integer variables have to be introduced. There are many ways to define these integer variables. We show that the minimal number of integer variables required to encode an instance is achieved by introducing an integer v...

We study the complexity of computing the mixed-integer hull conv(P ∩ Z ×R) of a polyhedron P . Given an inequality description, with one integer variable, the mixed-integer hull can have exponentially many vertices and facets in d. For n, d fixed, we give an algorithm to find the mixed integer hull in polynomial time. Given P = conv(V ) and n fixed, we compute a vertex description of the mixed-...

Motivated by recent advances in solution methods for mixed-integer convex optimization (MICP), we study the fundamental and open question of which sets can be represented exactly as feasible regions MICP problems. We establish several results this direction, including first complete characterization mixed-binary case a simple necessary condition general case. use latter to derive non-representa...

in this paper, the energy efficient resource allocation in noma-based heterogeneous cellular network(hcn) systems is investigated. since energy consumption and its limitations is one of the important challenges in fifth generation of cellular networks (5g), we propose a resource allocation problem which allocates power and subcarriers to multiple users to achieve the best system energy efficien...