Showing 1 - 10 of 177,188
Persistent link: https://www.econbiz.de/10009007769
Persistent link: https://www.econbiz.de/10003653581
We consider a new semidefinite programming (SDP) relaxation of the symmetric traveling salesman problem (TSP), that may …
Persistent link: https://www.econbiz.de/10012722396
Persistent link: https://www.econbiz.de/10014560650
Recently hybrid metaheuristics have been design to find solutions for combinatorial optimisation problems. We focus on hybrid procedures that combine local search based metaheuristics with exact algorithms of the operations research field. We present a mapping that outlines the metaheuristic and...
Persistent link: https://www.econbiz.de/10014035361
Persistent link: https://www.econbiz.de/10013417067
Persistent link: https://www.econbiz.de/10013417093
Persistent link: https://www.econbiz.de/10013417110
We construct convex, semidefinite programming (SDP) relaxations of the convex hull of association schemes with given parameters. As an application, we obtain new and known SDP relaxations of several combinatorial optimizations problems, including the traveling salesman and cycle covering...
Persistent link: https://www.econbiz.de/10014206636
In this paper we study the Traveling Salesman Problem with release dates (TSP-rd) and completion time minimization. The … TSP-rd considers a single vehicle and a set of customers that must be served exactly once with goods that arrive to the …, the proposed model is adapted to new TSP-rd variants (Capacitated and Prize-Collecting TSP), with different objectives …
Persistent link: https://www.econbiz.de/10014518066