9842 search results - page 317 / 1969 » The Complexity of the Matching-Cut Problem |
153
click to vote
ICICIC
2006
IEEE
15 years 10 months ago
2006
IEEE
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
125
click to vote
GECCO
2004
Springer
15 years 9 months ago
2004
Springer
It is crucial to maximize marketing efficiency and customer satisfaction in personalized marketing. In this paper, we raise the multiple recommendation problem which occurs when pe...
132
click to vote
CIMCA
2005
IEEE
15 years 9 months ago
2005
IEEE
We present some proposals to approximately solve a period vehicle routing problem used to model the extraction of oil from a set of onshore oil wells in Brazil. This problem diffe...
123
click to vote
SAT
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...
189
click to vote
EVOW
2009
Springer
15 years 10 months ago
2009
Springer
This paper proposes a discrete particle swarm optimization (DPSO) to solve the multiple destination routing (MDR) problems. The problem has been proven to be NP-complete and the tr...