No abstract

In agriculture, the soil properties influence the productivity and quality of crops. The farmer expects that in a specific area of the land, the physicochemical characteristics of the soil will be homogeneous as the selected crop has the desired quality and minimizes the use of fertilizers. There are three approaches to determining the correct delimitation of the land in the state-of-the art. The first one (k-means and fuzzy k-means) is impractical for current agricultural technology. The second approach is based on integer linear programming and a pre-processing step. This approach limits the shapes of delimited zones to rectangular, and the third approach extends the solution search space and generates orthogonal regions using Estimation of Distribution Algorithms (EDA). In this work, we generate orthogonal regions with a different approach to the EDA, a greedy construction heuristic. Our heuristic produces feasible solutions with a reasonable running time compared with the running times of EDA.

Graph anticoloring problem is partial coloring problem where the main feature is the opposite rule of the graph coloring problem, i.e., if two vertices are adjacent, their assigned colors must be the same or at least one of them is uncolored. In the same way, Berge in 1972 proposed the problem of placing b black queens and w white queens on a n × n chessboard such that two queens of different color can not attack to each other, the complexity of this problem remains open. In this work we deal with the knight piece under the balance property, since this special case is the most difficult for brute force algorithms.