In this paper, we propose a chance-constrained mathematical program for fixed broadband wireless networks under unreliable channel conditions. The model is reformulated as integer linear program and valid inequalities are derived for the corresponding polytope. Computational results show that by an exact separation approach the optimality gap is closed by 42 % on average.

The application of specification-based program verification techniques (e.g., black-box testing, formal proof) faces strong challenges in practice when the gap between the structure of a specification and that of its program is large. This paper describes a viewbased program review approach to addressing these challenges. The essential idea of the approach is first to derive comparable views fr...

The following paradigm is often used for handling NP-hard combinatorial optimization problems. One first formulates the problem as an integer program, then one relaxes it to a linear program (LP, or more generally, a convex program), then one solves the LP relaxation in polynomial time, and finally one rounds the optimal LP solution, obtaining a feasible solution to the original problem. Many o...

Migrant students face unique challenges and obstacles in their educational journey, particularly terms of social support overall well-being. This study aims to examine the relationship between well-being migrant participating Affirmation Education Program (ADik) Papua 3T Regions. Using a quantitative approach, data was collected from sample 34 active through surveys in-depth interviews. The emp...