Sciweavers

14548 search results - page 162 / 2910
» The Optimal Path-Matching Problem
Sort
View
DAM
1998
77views more  DAM 1998»
13 years 10 months ago
Optimal Wavelength-routed Multicasting
Motivated by wavelength division multiplexing in all-optical networks, we consider the problem of finding a set of paths from a fixed source to a multiset of destinations, which c...
Bruno Beauquier, Pavol Hell, Stephane Perennes
EOR
2000
115views more  EOR 2000»
13 years 10 months ago
An effective implementation of the Lin-Kernighan traveling salesman heuristic
This report describes an implementation of the Lin-Kernighan heuristic, one of the most successful methods for generating optimal or nearoptimal solutions for the symmetric travel...
Keld Helsgaun
CEC
2009
IEEE
14 years 3 months ago
Benchmarking and solving dynamic constrained problems
— Many real-world dynamic optimisation problems have constraints, and in certain cases not only the objective function changes over time, but the constraints also change as well....
Trung Thanh Nguyen, Xin Yao
GECCO
2006
Springer
133views Optimization» more  GECCO 2006»
14 years 2 months ago
Search--based approaches to the component selection and prioritization problem
This poster paper addresses the problem of choosing sets of software components to combine in component
Mark Harman, Alexandros Skaliotis, Kathleen Steinh...
CLOUDCOM
2010
Springer
13 years 8 months ago
Cost-Optimal Outsourcing of Applications into the Clouds
Abstract--Commercial services for provisioning software components and virtual infrastructure in the cloud are emerging. For customers, this creates a multitude of possibilities fo...
Immanuel Trummer, Frank Leymann, Ralph Mietzner, W...