Sciweavers

14739 search results - page 169 / 2948
» An optimization problem on the sphere
Sort
View
4OR
2004
84views more  4OR 2004»
14 years 10 months ago
Non-classical preference models in combinatorial problems: Models and algorithms for graphs
This is a summary of the most important results presented in the author's PhD thesis (Spanjaard, 2003). This thesis, written in French, was defended on 16 December 2003 and su...
Olivier Spanjaard
ICTAI
2005
IEEE
15 years 4 months ago
Using a Lagrangian Heuristic for a Combinatorial Auction Problem
In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...
ANTSW
2004
Springer
15 years 4 months ago
A Comparison Between ACO Algorithms for the Set Covering Problem
Abstract. In this paper we present a study of several Ant Colony Optimization (ACO) algorithms for the Set Covering Problem. In our computational study we emphasize the influence ...
Lucas Lessing, Irina Dumitrescu, Thomas Stütz...
ICCAD
1997
IEEE
95views Hardware» more  ICCAD 1997»
15 years 2 months ago
An exact solution to simultaneous technology mapping and linear placement problem
In this paper, we present an optimal algorithm for solving the simultaneous technology mapping and linear placement problem for tree-structured circuits with the objective of mini...
Jinan Lou, Amir H. Salek, Massoud Pedram
CCIA
2007
Springer
15 years 2 months ago
An efficient estimation function for the crew scheduling problem
In this paper we explain an estimation function for the crew scheduling problem in the coach transportation domain. Thanks to this function we obtain an estimation that is very clo...
Javier Murillo, Beatriz López