Code: 06390180
Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title reports on the research carried out by participants during the Ninth DIMA ... more
English
146.57 €
Availability:
50/50
We think title might be available. Upon your order we will do our best to get it within 6 weeks.
Enter your e-mail address and once book will be available,
we will send you a message. It's that simple.
You get 355 loyalty points
Book synopsis
Shortest path problems are among the most fundamental combinatorial optimization problems with many applications, both direct and as subroutines. This title reports on the research carried out by participants during the Ninth DIMACS Implementation Challenge, which led to several improvements of the state of the art in shortest path algorithms.
Book details
Book category Books in English Mathematics & science Mathematics Discrete mathematics
146.57 €
EnglishCollection points Bratislava a 12830 dalších
Copyright ©2008-26 najlacnejsie-knihy.sk All rights reservedPrivacyCookies
25664 collection points
Delivery 2.99 €
02/210 210 99 (8-15.30h)Shopping cart ( Empty )