2244 search results - page 172 / 449 » A new heuristic approach for non-convex optimization problem... |
192
click to vote
EVOW
2010
Springer
15 years 10 months ago
2010
Springer
Optimization problems are more and more complex and their resource requirements are ever increasing. Although metaheuristics allow to significantly reduce the computational complex...
164
click to vote
COR
2007
15 years 7 months ago
2007
The paper discusses the definition and solution of a bi-objective routing problem, namely the bi-objective covering tour problem. The bi-objective CTP is a generalization of the ...
177
click to vote
4OR
2005
15 years 7 months ago
2005
Many real problems can be modelled as robust shortest path problems on digraphs with interval costs, where intervals represent uncertainty about real costs and a robust path is not...
193
click to vote
TRANSCI
2010
15 years 5 months ago
2010
We propose a new method to compute bid prices in network revenue management problems. The novel aspect of our method is that it naturally provides dynamic bid prices that depend o...
192
click to vote
ICMCS
1999
IEEE
15 years 11 months ago
1999
IEEE
Advances in networking and transmission of digital multimedia data will bring soon huge catalogues of music to users. Accessing these catalogues raises a problem for users and con...