Solving traveling salesman problems using branch and bound methods

QR Code

Solving traveling salesman problems using branch and bound methods

Bibliographic Details
Format:	Restricted Document

Similar Items

An efficient approach for traveling salesman problem solution with branch-and-bound

Solving traveling salesman problem on cluster compute nodes
by: I.A., Aziz, et al.
Published: (2009)

Solving the Traveling Salesman’s Problem using the African Buffalo Optimization
by: Odili, Julius Beneoluchi, et al.
Published: (2016)

Tutorials on African Buffalo Optimization for Solving the Travelling Salesman Problem
by: Odili, Julius Beneoluchi, et al.
Published: (2017)

Particle swarm optimization with partial search for solving traveling salesman problem
by: Akhand, M. A. H, et al.
Published: (2014)

Particle swarm optimization with partial search to solve traveling salesman problem
by: Akhand, M.A.H., et al.
Published: (2012)

Genetic algortihm to solve pcb component placement modeled as travelling salesman problem
by: Mohd Khazzarul Khazreen, Mohd Zaidi
Published: (2013)

Traveling salesman problem approach for solving petrol distribution using simulated annealing and tabu search
by: Wan Ibrahim, Wan Rohaizad
Published: (2007)

Intelligent route optimization for travelling salesman problem
by: Liong, Kah Mee
Published: (2014)

Traveling salesman approach for solving petrol distribution using simulated annealing
by: Ismail, Zuhaimy, et al.
Published: (2008)

New genetic operator for solving the travelling salesman problem / Fadzilawani Astifar Alias ... [et al.]
by: Alias, Fadzilawani Astifar, et al.
Published: (2015)

A comparative performance analysis of computational intelligence techniques to solve the asymmetric travelling salesman problem
by: Odili, Julius Beneoluchi, et al.
Published: (2021)

Route Optimization based on Clustering and Travelling Salesman Problem
by: Khadijah, Thahira, et al.
Published: (2022)

Swarm intelligence algorithms’ solutions to the travelling salesman’s problem
by: Odili, Julius Beneoluchi, et al.
Published: (2020)

Hierarchical Approach in Clustering to Euclidean Traveling Salesman Problem
by: Fajar, A., et al.
Published: (2011)

Solution of maximum clique problem by using branch and bound method

Genetic algorithm to optimize routing problem modelled as the travelling salesman problem
by: Muhammad Azrul Faiz , Nor Adzmi
Published: (2013)

Solution of capital investment problems via branch and bounds method
by: Zainodin Haji Jubok,
Published: (1996)

Solving Traveling Salesman’s Problem Using African Buffalo Optimization, Honey Bee Mating Optimization & Lin-Kerninghan Algorithms
by: Odili, Julius Beneoluchi, et al.
Published: (2016)

Simulated Kalman Filter with modified measurement, substitution mutation and hamming distance calculation for solving traveling salesman problem
by: Suhazri Amrin, Rahmad, et al.
Published: (2022)

Velocity tentative PSO: An optimal velocity implementation based particle swarm optimization to solve traveling salesman problem

Optimization of Traveling Salesman Problem with Precedence Constraint using Particle Swarm Optimization
by: M. F. F., Ab Rashid, et al.
Published: (2015)

Optimization of travelling salesman problem with precedence constraint using modified GA encoding
by: M. F. F., Ab Rashid, et al.
Published: (2018)

Comparison between ant colony and genetic algorithm using traveling salesman problem
by: Abduljabbar, Zaid Ammen, et al.
Published: (2013)

A GPU accelerated parallel genetic algorithm for the traveling salesman problem
by: Binjubier, Mohammed, et al.
Published: (2024)

A Comparative Study of Neural Networks methods & the African Buffalo Optimization for the Travelling Salesman’s Problems
by: Odili, Julius Beneoluchi, et al.
Published: (2017)

An Efficient Solution to Travelling Salesman Problem using Genetic Algorithm with Modified Crossover Operator
by: Hossain, Md. Sabir, et al.
Published: (2019)

Branch and bound algorithm for finding the maximum clique problem

African Buffalo Optimization and the Randomized Insertion Algorithm for the Asymmetric Travelling Salesman’s Problems
by: Odili, Julius Beneoluchi, et al.
Published: (2016)

Performance Analyses of Nature-inspired Algorithms on the Traveling Salesman’s Problems for Strategic Management
by: Julius, Beneoluchi Odili, et al.
Published: (2017)

A genetic algorithm for symmetric travelling salesman problem eith due dates
by: Lee, Lai Soon, et al.
Published: (2007)

Machine learning based route optimization for the travelling salesman problem with pickup and delivery
by: Ong, Zhi Ying
Published: (2023)

A mathematical study on "additive technique" versus "branch and bound technique" for solving binary programming problem
by: Sufahani, Suliadi Firdaus, et al.
Published: (2018)

An investigation of the ant-based hyper-heuristic for capacitated vehicle routing problem and traveling salesman problem
by: Abd Aziz, Zalilah
Published: (2013)

Improved Dynamic Ant Colony System (DACS) on Symmetric Traveling Salesman Problem (TSP).
by: Md Rais, Helmi, et al.
Published: (2007)

Hybridising local search with Branch-and-Bound for constrained portfolio selection problems
by: He, Fang, et al.
Published: (2016)

A novel solution to traveling salesman problem using fuzzy sets, gravitational search algorithm, and genetic algorithm
by: Abarghouei, Amir Atapour
Published: (2010)

A Comparative Study of African Buffalo Optimization and Randomized Insertion Algorithm for Asymmetric Travelling Salesman's Problem
by: Odili, Julius Beneoluchi, et al.
Published: (2015)

A genetic simplified swarm algorithm for optimizing n-cities open loop travelling salesman problem
by: Chieng, Hock Hung
Published: (2016)

Application of Travelling Salesman Problem for Minimizing Travel Distance of a Two-Day Trip in Kuala Lumpur via Go KL City Bus
by: Wan Nor Ashikin, Wan Ahmad Fatthi, et al.
Published: (2019)

Cannot write session to /tmp/vufind_sessions/sess_j9kebp3855rsa34r00vftancjg