|
|
|
|
|
Christos Valouxis, Christos Gogos, Angelos Dimitsas, Petros Potikas and Anastasios Vittas
Machine scheduling is a hard combinatorial problem having many manifestations in real life. Due to the schedule followed, the possibility of installations of machines operating sub-optimally is high. In this work, we examine the problem of a single machi...
ver más
|
|
|
|
|
|
|
|
|
Marcus R. Garvie and John Burkardt
The general problem of tiling finite regions of the plane with polyominoes is ????
NP
-complete, and so the associated computational geometry problem rapidly becomes intractable for large instances. Thus, the need to reduce algorithm complexity for tilin...
ver más
|
|
|
|
|
|
|
|
|
Marcus R. Garvie and John Burkardt
Checkerboard colouring arguments for proving that a given collection of polyominoes cannot tile a finite target region of the plane are well-known and typically applied on a case-by-case basis. In this article, we give a systematic mathematical treatment...
ver más
|
|
|
|
|
|
|
|
|
Sara Pérez-Carabaza, Akemi Gálvez and Andrés Iglesias
Ant Colony Optimization (ACO) encompasses a family of metaheuristics inspired by the foraging behaviour of ants. Since the introduction of the first ACO algorithm, called Ant System (AS), several ACO variants have been proposed in the literature. Owing t...
ver más
|
|
|
|
|
|
|
|
|
Brandon Cortés-Caicedo, Oscar Danilo Montoya and Andrés Arias-Londoño
In this research paper, a combinatorial optimization approach is proposed for parameter estimation in single-phase transformers considering voltage and current measurements at the transformer terminals. This problem is represented through a nonlinear pro...
ver más
|
|
|
|