Sciweavers

594 search results - page 59 / 119
» Travelling Miser Problem
Sort
View
IPPS
2005
IEEE
14 years 1 months ago
A Distributed Chained Lin-Kernighan Algorithm for TSP Problems
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
Thomas Fischer, Peter Merz
EOR
2008
97views more  EOR 2008»
13 years 8 months ago
Optimization models for the single delay management problem in public transportation
Passengers travelling in public transportation networks often have to use different lines to cover the trip from their origin to the desired destination. As a consequence, the rel...
Géraldine Heilporn, Luigi De Giovanni, Mart...
ICEB
2004
297views Business» more  ICEB 2004»
13 years 9 months ago
Security Measures in Mobile Commerce: Problems and Solutions
Due to the advent of the Internet, electronic business transactions have exploded around the globe. Along with the Internet, wireless technology has exponentially developed as wel...
Sanwar Ali, Waleed Farag, Mohammad A. Rob
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
13 years 6 months ago
Beyond isolation: research opportunities in declarative data-driven coordination
There are many database applications that require users to coordinate and communicate. Friends want to coordinate travel plans, students want to jointly enroll in the same set of ...
Lucja Kot, Nitin Gupta 0003, Sudip Roy, Johannes G...
ICUMT
2009
13 years 5 months ago
A COP for cooperation in a P2P streaming protocol
This paper introduces a Combinatory Optimization Problem (COP) which captures the performance in cooperation of a P2P Streaming Network, considered at the buffer level. A new famil...
María Elisa Bertinat, Darío Padula, ...