: To make a new problem from the original one and to compare their solutions are promising activities to promote a learner to be aware of the structure of these problems. Especiall...
Cascadic multilevel methods for the solution of linear discrete ill-posed problems with noise-reducing restriction and prolongation operators recently have been developed for the r...
A parallel simulated annealing algorithm to solve the vehicle routing problem with time windows is presented. The objective is to find the best possible solutions to some wellkno...
Ill-posed problems are numerically underdetermined. It is therefore often beneficial to impose known properties of the desired solution, such as nonnegativity, during the solution...
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for ...