the set covering problem (scp) is a well-known combinatorial optimization problem. this paper investigates development of a local branching approach for the scp. this solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. the algorithm parameters are tuned by design of experiments approach. the proposed method is te...

The set covering problem (SCP) is a well-known combinatorial optimization problem. This paper investigates development of a local branching approach for the SCP. This solution strategy is exact in nature, though it is designed to improve the heuristic behavior of the mixed integer programming solver. The algorithm parameters are tuned by design of experiments approach. The proposed method is te...

Local branching is a general purpose heuristic method which searches locally around the best known solution by employing tree search. It has been successfully used in Mixed Integer Programming (MIP) where local branching constraints are used to model the neighborhood of an incumbent solution and improve the bound. The neighborhoods are obtained by linear inequalities in the MIP model so that MI...

We present new results from applying the assumptions of two-player game searches, namely limited search horizon and commitment to moves in constant time, to single-agent problem-solving searches. We show that the search depth achievable with alpha pruning for a given amount of computation actually increases with increasing branching factor. We prove that real-time-A* (RTA*) makes locally optima...

In this paper, we propose a variable depth search (VDS) algorithm for the generalized assignment problem (GAP), which is one of the representative combinatorial optimization problems, and is known to be NP-hard. The VDS is a generalization of the local search. The main idea of VDS is to change the size of the neighborhood adaptively so that the algorithm can e ectively traverse larger search sp...

to evaluate the effect of zn sulfate foliar application on morphologic and quantitative characteristics of safflower (carthamus tinctorius l.) cultivars, a field experiment carried out in ramin agriculture and natural resources university of khouzestan, iran, in a factorial arrangement in a randomized complete block design with four replications, during 2012-2013. treatments consisted of two sp...

This paper discusses the implementation of a branching time temporal logic CTL model checker for the PROD Pr/T-Net Reachability analysis tool. A new algorithm for model checking CTL is presented. This algorithm doesn't need the converse of the transition relation as the EMC algorithm does 4]. The algorithm also provides a counterexample and witness facility using one-pass reachabil-ity graph tr...