Results 81 to 90 of about 16,247 (139)
Solving Constraint Satisfaction Problems with Networks of Spiking Neurons. [PDF]
Front Neurosci, 2016 Jonke Z, Habenschuss S, Maass W.
europepmc +1 more source
Strong light-matter coupling in van der Waals materials. [PDF]
Light Sci ApplLuo Y +12 more
europepmc +1 more source
Improved model building for cryo-EM maps using local attention and 3D rotary position embedding
Su B, Huang K, Peng Z, Amunts A, Yang J.
europepmc +1 more source
A Multi-Start Iterated Local Search Algorithm for the Bottleneck Traveling Salesman Problem
2022 IEEE 19th India Council International Conference (INDICON), 2022 The bottleneck traveling salesman problem (BTSP) is a variation of the well-known traveling salesman problem (TSP) in which the goal is to identify a Hamiltonian circuit with the lowest maximum edge cost among its constituent edges on a complete graph ...
Viknesh Rajaramon, Venkatesh Pandiri
semanticscholar +3 more sources
An Algorithm for the Bottleneck Traveling Salesman Problem
Operations Research, 1984 Given a graph with arc costs, the Bottleneck Traveling Salesman Problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs. Lower bounds for the problem (bottleneck assignment problem, bottleneck paths, bottleneck arborescence, cuts) are analyzed and combined to obtain a bounding procedure for a breadth-first branch ...
G. Carpaneto +2 more
semanticscholar +4 more sources
The asymmetric bottleneck traveling salesman problem: Algorithms, complexity and empirical analysis
Computers & Operations Research, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
John Larusic, Abraham P. Punnen
semanticscholar +4 more sources
A Hybrid Genetic Algorithm for the Bottleneck Traveling Salesman Problem
ACM Transactions on Embedded Computing Systems, 2013 The bottleneck traveling salesman problem is to find a Hamiltonian circuit that minimizes the largest cost of any of its arcs in a graph. A simple genetic algorithm (GA) using sequential constructive crossover has been developed to obtain heuristic solution to the problem.
Zakir Hussain Ahmed
semanticscholar +3 more sources
Bi-Trajectory Hybrid Search to Solve Bottleneck-Minimized Colored Traveling Salesman Problems
IEEE Transactions on Automation Science and Engineering, 2023 A bottleneck-minimized colored traveling salesman problem is an important variant of colored traveling salesman problems. It is useful in handling the planning problems with partially overlapped workspace such as the scheduling transportation resources ...
Yangming Zhou +3 more
semanticscholar +3 more sources
2018 3rd International Conference on Smart City and Systems Engineering (ICSCSE), 2018 Due to the existence of multiple constraints and multiple optimization objectives, the competition decision for bottleneck traveling salesman problem is very difficult. The paper proposes the competition decision for bottleneck traveling salesman based on big data mining algorithm with multi-segment support.
Ying Dai
semanticscholar +3 more sources
A linear time algorithm for the bottleneck traveling salesman problem on a Halin graph
Information Processing Letters, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Jeffrey Mark Phillips +2 more
semanticscholar +3 more sources