This paper focuses on the capacitated minimum spanning tree(CMST)problem.Given a central processor and a set of remote terminals with specified demands for traffic that must flow between the central processor and terminals,the ...

In this paper, we investigate Astronomical Observations Scheduling which is a type of Multi-Objective Combinatorial Optimization Problem, and detail its specific challenges and requirements and propose the Hybrid Accumulative ...

The scheduling process on every production line is of principal importance as it directly affects the productivity of a company. For decades now, operational research has offered managers tools to automate their scheduling ...

We present a C++ implementation of a skeleton for Tabu Search method. Tabu Search method is a well-known meta-heuristic that has proved successful for sub-optimally solving hard combinatorial optimization problems. Recently ...

Network Alignment (NA) is a hard optimization problem with important applications such as, for example, the identification of orthologous relationships between different proteins and of phylogenetic relationships between ...

In this paper we address the question of how people make decisions in the context of a knapsack problem, which is a simplified version of a portfolio project management problem. We expect people to be influenced by the ...

Radio Resource Management with Inter-cell Interference Coordination (ICIC), is a key issue under investigation for next generation wireless systems such as Long Term Evolution (LTE). Although centralized resource allocation ...

In this paper we present the application of a recently proposed, general, algorithm for combinatorial optimization to the repetition-free longest common subsequence problem. The applied algorithm, which is labelled Construct, ...

Las redes de sensores inalámbricos se han ido usando cada vez más en los últimos años debido a su capacidad de observar el entorno, procesar datos y tomar decisiones. Estas características han ganado importancia en el ...

A greedy heuristics to solve a given combinatorial optimisation problem can be seen as an element of an infinite set of heuristics, H, which is defined by a function that depends on several parameters. We propose a procedure ...