Abstract. We describe a new algorithm for solving linear integer programming problems. The algorithm performs a DPLL style search for a feasible assignment, while using a novel cut...
The Open-Shop Problem is a hard problem that can be solved using Constraint Programming or Operation Research methods. Existing techniques are efficient at reducing the search tree...
Abstract. Context plays an important role in general scene perception. In particular, it can provide cues about an object’s location within an image. In computer vision, object d...
We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
This paper introduces a hybrid metaheuristic, the Variable Neighborhood Particle Swarm Optimization (VNPSO), consisting of a combination of the Variable Neighborhood Search (VNS) ...