|
|
|
|
|
Christos Papalitsas, Theodore Andronikos, Konstantinos Giannakis, Georgia Theocharopoulou and Sofia Fanarioti
This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a quadratic unconstrained binary optimization (QUBO) problem. The time windows impose time constraints that a feasible solution must satisfy. These take the form of inequality...
ver más
|
|
|
|
|