Orienteering problems models algorithms par vansteenwegen pieter (20 résultats)

hardcover. Etat : New. Brand new book, sourced directly from publisher. Dispatch time is 24-48 hours from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely.

Etat : good.

Etat : very_good. Supports Goodwill of Silicon Valley job training programs. The cover and pages are in very good condition! The cover and any other included accessories are also in very good condition showing some minor use. The spine is straight, there are no rips tears or creases on the cover or the pages.…

Etat : As New. Unread book in perfect condition.

PF. Etat : New.

Etat : New. In English.

Etat : New.

Etat : New. pp. XVII, 112 56 illus., 38 illus. in color. 1st ed. 2019 edition NO-PA16APR2015-KAP.

Etat : As New. Unread book in perfect condition.

Etat : New.

Etat : New. In English.

Etat : New.

Etat : As New. Unread book in perfect condition.

Buch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problems, the book mainly focuses on the OP. In turn, other problems are presented as variants of the OP, focusing on the similarities and differences. The goal of the OP is to determine a subset of nodes to visit and in which order, so that the total collected profit is maximized and a given time budget is not exceeded.The book provides a comprehensive review of variants of the OP, such as the team OP, the team OP with time windows, the profitable tour problem, and the prize-collecting travelling salesperson problem. In addition, it presents mathematical models and techniques for solving these OP variants and discusses their complexity. Several simple examples and benchmark instances, together with their best-known results, are also included. Finally, the book reviews the latest applications of these problems in the fields of logistics, tourism and others.…

Taschenbuch. Etat : Neu. Orienteering Problems | Models and Algorithms for Vehicle Routing Problems with Profits | Pieter Vansteenwegen (u. a.) | Taschenbuch | xvii | Englisch | 2020 | Springer | EAN 9783030297480 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Hardcover. Etat : Brand New. 132 pages. 9.25x6.10x0.51 inches. In Stock.

Paperback. Etat : New. NEW. SHIPS FROM MULTIPLE LOCATIONS. book.

Etat : New. Print on Demand pp. XVII, 112 56 illus., 38 illus. in color.

Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This tutorial introduces readers to several variants of routing problems with profits. In these routing problems each node has a certain profit, and not all nodes need to be visited. Since the orienteering problem (OP) is by far the most frequently studied problem in this category of routing problems, the book mainly focuses on the OP. In turn, other problems are presented as variants of the OP, focusing on the similarities and differences. The goal of the OP is to determine a subset of nodes to visit and in which order, so that the total collected profit is maximized and a given time budget is not exceeded.The book provides a comprehensive review of variants of the OP, such as the team OP, the team OP with time windows, the profitable tour problem, and the prize-collecting travelling salesperson problem. In addition, it presents mathematical models and techniques for solving these OP variants and discusses their complexity. Several simple examples and benchmark instances, together with their best-known results, are also included. Finally, the book reviews the latest applications of these problems in the fields of logistics, tourism and others.…

Etat : New. PRINT ON DEMAND pp. XVII, 112 56 illus., 38 illus. in color.