Работы, цитирующие эту работу

Работ: 2

Работа: A travelling salesman problem with allocation, time window and precedence constraints — an application to ship scheduling

1. On the Convergence of an Efficient and Robust Dynamic Neural Network Concept with Application to Solving Traveling Salesman Problems

   Elnur Norov, Shakhzod Tashmetov, Khabibullo Nosirov +3

   СтатьяMetaheuristic Optimization Algorithms ResearchWSEAS TRANSACTIONS ON CIRCUITS AND SYSTEMS2022Цитирований: 1

   ABIABI:AkademIndex/openalex/2022.article.001494

2. Decomposition algorithm for the multi-trip single vehicle routing problem with AND-type precedence constraints

   Mina Roohnavazfar, Seyed Hamid Reza Pasandideh

   ПрепринтVehicle Routing Optimization MethodsOperational Research2021Цитирований: 0

   ABIABI:AkademIndex/openalex/2021.preprint.000106