Sciweavers

1404 search results - page 13 / 281
» Optimization problems in multiple-interval graphs
Sort
View
INFORMATICALT
2000
125views more  INFORMATICALT 2000»
13 years 9 months ago
An Algorithm for Construction of Test Cases for the Quadratic Assignment Problem
In this paper we present an algorithm for generating quadratic assignment problem (QAP) instances with known provably optimal solution. The flow matrix of such instances is constru...
Gintaras Palubeckis
ATMOS
2010
308views Optimization» more  ATMOS 2010»
13 years 8 months ago
The Team Orienteering Problem: Formulations and Branch-Cut and Price
The Team Orienteering Problem is a routing problem on a graph with durations associated to the arcs and profits assigned to visiting the vertices. A fixed number of identical ve...
Marcus Poggi de Aragão, Henrique Viana, Edu...
CORR
2011
Springer
192views Education» more  CORR 2011»
13 years 4 months ago
On cooperative patrolling: optimal trajectories, complexity analysis, and approximation algorithms
—The subject of this work is the patrolling of an environment with the aid of a team of autonomous agents. We consider both the design of open-loop trajectories with optimal prop...
Fabio Pasqualetti, Antonio Franchi, Francesco Bull...
NHM
2010
87views more  NHM 2010»
13 years 4 months ago
The coolest path problem
We introduce the coolest path problem, which is a mixture of two well-known problems from distinct mathematical fields. One of them is the shortest path problem from combinatorial ...
Martin Frank, Armin Fügenschuh, Michael Herty...
SAT
2007
Springer
146views Hardware» more  SAT 2007»
14 years 3 months ago
Algorithms for Variable-Weighted 2-SAT and Dual Problems
Abstract. In this paper we study NP-hard weighted satisfiability optimization problems for the class 2-CNF providing worst-case upper time bounds. Moreover we consider the monoton...
Stefan Porschen, Ewald Speckenmeyer