The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
—We consider Initial-Boundary value problems associated with nonlinear hyperbolic partial differential equation in three independent variables, in a general setting wherein the ...
This work deals with trajectory optimization for a network of robotic sensors sampling a spatio-temporal random field. We examine the problem of minimizing over the space of networ...