- Почетна страница /
- Knjige /
- Science & Math /
- Mathematics /
- Applied /
- Graph Theory /
- Approximation Algorithms for Traveling Salesm...
Approximation Algorithms for Traveling Salesman Problems
89% of respondents would recommend this to a friend
RSD 18787
Price Details
Excluding Shipping & Custom charges ( Shipping and custom charges will be calculated on checkout )
*All items will import from SAD
QTY:
Ubuy works hard to protect your security and privacy. Our advanced payment security system ensures confidentiality by encrypting your information during transmission using AES (Advanced Encryption Standards) and SSL (Secure Socket Layer) protocols. Your payment details are 100% secure as we do not share your payment details with third party sellers.
This book constitutes and advances the state of the art and makes it accessible to a wider audience.
Fast
Shipping
Free
Return*
Secure Packaging
100% Original Products
PCI DSS Compliance
ISO 27001 Certified
What Stands Out
Детаљи о производу
| Publisher | Cambridge University Press |
| Publication date | December 5, 2024 |
| Edition | 1st |
| Language | English |
| Print length | 444 pages |
| ISBN-10 | 1009445413 |
| ISBN-13 | 978-1009445412 |
| Item Weight | 1.69 pounds (770 grams) |
| Dimensions | 6 x 1 x 9 inches (15.2 x 2.5 x 22.9 cm) |
Who Should Buy?
-
Students of Algorithms
Ideal for students studying algorithm design and optimization techniques, particularly in computer science or operations research fields.
-
Research Academics
Beneficial for researchers focusing on approximation algorithms and combinatorial optimization in theoretical computer science.
-
Professionals in Logistics
Useful for logistics professionals dealing with route optimization problems requiring practical applications of approximation algorithms.
-
Casual Readers
Not suitable for individuals looking for a light read; it requires a strong foundation in algorithm analysis.
OPIS PROIZVODA
Approximation Algorithms for Traveling Salesman Problems
Питања и одговори купаца
-
Pitanje:
Како купити Approximation Algorithms for Traveling Salesman на мрежи од Убуи-а?
Odgovor: Лако је куповати Approximation Algorithms for Traveling Salesman на мрежи од Убуи-а.. Морате само да потражите производ, изаберете начин испоруке приликом одјављивања и да га испоручите на вашу локацију. -
Pitanje:
Да ли је Approximation Algorithms for Traveling Salesman доступан за онлајн куповину у Serbia?
Odgovor: Да, у Убуи Serbia овај производ је доступан за куповину по разумној цени.. Approximation Algorithms for Traveling Salesman није доступан локално, али можете нам веровати у наше услуге експресне испоруке. -
Pitanje:
Колико времена је потребно да се производ добије након наручивања?
Odgovor: Време испоруке вашег нарученог производа варира у зависности од тога шта сте наручили и начина испоруке који сте изабрали.. Процењено време испоруке се помиње током процеса плаћања, па будите безбрижни док купујете.
Graph Theory Editorial Review
Customer Reviews & Ratings
-
5 zvezda
100%
-
4 zvezda
0%
-
3 zvezda
0%
-
2 zvezda
0%
-
1 zvezda
0%
Ocenite ovaj proizvod
Podelite svoja razmišljanja sa drugim kupcima
Прос
- Comprehensive coverage of algorithms
- Clear and detailed explanations
- Strong focus on practical applications
- Engaging examples and exercises
- Well-organized structure
Цонс
- Some advanced topics may be challenging.
Product Price History
Važna informacija
- Ograničenja: Za proizvode koji se isporučuju međunarodno, imajte na umu da garancija proizvođača možda neće biti važeća; opcije servisiranja proizvođača možda neće biti dostupne; priručnici za proizvode, uputstva i upozorenja o bezbednosti možda nisu na jezicima zemlje odredišta; proizvodi (i prateći materijali) ne moraju biti dizajnirani u skladu sa standardima zemlje odredišta, specifikacijama i zahtevima za označavanje; a proizvodi možda nisu u skladu sa naponom zemlje odredišta i drugim električnim standardima (zahteva se upotreba adaptera ili pretvarača ako je potrebno). Primalac je odgovoran za osiguranje da se proizvod može zakonito uvesti u odredišnu zemlju. Prilikom naručivanja od kompanije Ubuy ili njegovih podružnica, primalac je nadležni uvoznik i mora se pridržavati svih zakona i propisa zemlje odredišta.
- Nisu svi proizvodi navedeni na Ubuy-u na prodaju, jer je Ubuy globalni pretraživač. Proizvodi podležu izvoznim/trgovačkim propisima.
RSD 18787
Naručite sada i dobijte oko Sreda, Oktobar 21
This item is not restrict in my country.(Please click on above link if this item is not restrict in your country, So our team will review and allow.)
QTY:
PCI DSS compliant and ISO 27001:2022 certified, with encrypted payments and full buyer protection on every order.
Карактеристике и предности
- First book dedicated to approximation algorithms for the Traveling Salesman Problem (TSP).
- Comprehensive collection of major results and intriguing open problems.
- Includes recent discoveries, with first-time publications on better algorithms.
- Accessible resource for teaching, self-study, and further research.
- Features detailed proofs, over 170 exercises, and 100 color figures.
- Ideal for students and researchers in discrete mathematics and combinatorial optimization.
Ubuy Assurance
Experience worry-free shopping with 100% original products, PCI DSS-compliant payment security, ISO 27001-certified data protection, the fastest cross-border delivery, free returns *, and secure packaging on every order.