Open Daily: 10am - 10pm | Alley door pickup 10am - 7pm 3038 Hennepin Ave Minneapolis, MN
612-822-4611

  • Open Daily: 10am - 10pm
    Alley-side Pickup: 10am - 7pm

    3038 Hennepin Ave Minneapolis, MN
    612-822-4611

Open Daily: 10am - 10pm | Alley-side Pickup: 10am - 7pm
3038 Hennepin Ave Minneapolis, MN
612-822-4611
New Techniques and Algorithms for Multiobjective and Lexicographic Goal-Based Shortest Path Problems

New Techniques and Algorithms for Multiobjective and Lexicographic Goal-Based Shortest Path Problems

Pulido Arrebola, Francisco J.

Paperback

General Computers

ISBN10: 3668132496
ISBN13: 9783668132498
Publisher: Grin Verlag
Published: Feb 2 2016
Pages: 196
Weight: 0.58
Height: 0.45 Width: 5.83 Depth: 8.27
Language: English
Doctoral Thesis / Dissertation from the year 2015 in the subject Computer Science - Miscellaneous, University of Málaga (University of Málaga), language: English, abstract: Imagine navigating a complex network, not just seeking the quickest route, but balancing multiple, often conflicting priorities - that's the challenge at the heart of this groundbreaking work on multiobjective shortest path problems. Delving into the intricate world of graph theory and optimization, this research introduces innovative algorithms designed to revolutionize how we approach pathfinding in scenarios demanding more than just speed. Explore the development of cutting-edge techniques to efficiently solve multiobjective shortest path problems, pushing the boundaries of existing methodologies and providing novel approaches to real-world applications. Journey through a comprehensive exploration of lexicographic goal-based shortest path problems, unraveling specialized algorithms meticulously crafted to manage preferences articulated through lexicographic orderings of objectives. Uncover the complexities of computational complexity analysis and witness rigorous performance evaluations that benchmark the newly developed algorithms against state-of-the-art techniques, validating their practical applicability and highlighting their superior performance benefits. This study provides a robust foundation in both theoretical advancements and practical implementations within the field of algorithms, suitable for seasoned researchers and students alike. Witness firsthand how these algorithms rise to meet the ever-increasing demands of modern problem-solving, promising more efficient and effective solutions to complex network challenges and paving the way for future innovation in related fields. The meticulous investigation of multiobjective and lexicographic shortest path problems culminates in a suite of powerful tools for tackling intricate optimization challenges, offering a significant leap forwa

Also in

General Computers

View All