6562 search results - page 117 / 1313 » Noetherianity and Combination Problems |
154
Voted
CSR
2009
Springer
15 years 5 months ago
2009
Springer
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
120
click to vote
COR
2007
15 years 4 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 ...
147
Voted
NETWORKS
2007
15 years 4 months ago
2007
We consider a combination of the capacitated vehicle routing problem and a class of additional loading constraints involving a parallel machine scheduling problem. The work is mot...
140
Voted
ISMIS
2009
Springer
15 years 11 months ago
2009
Springer
Static and transportation facility location allocation problem is a new problem in facility location research. It aims to find out optimal locations of static and transportation fa...
127
click to vote
IEAAIE
2005
Springer
15 years 10 months ago
2005
Springer
When using a constructive search algorithm, solutions to scheduling problems such as the job shop and open shop scheduling problems are typically represented as permutations of the...