Results 61 to 70 of about 232 (135)

A Linear Time Algorithm for the Bottleneck Biconnected Spanning Subgraph Problem

, 1996
A linear time algorithm for the Bottleneck Biconnected Spanning Subgraph problem is presented. This improves the hitherto best-known solution, which has a running time of O(m+ n log n), where m and n are the number of edges and vertices of the graph ...
Gurmeet Singh Manku
core  

Hamiltonian cycles in circulant digraphs with two stripes

, 1997
The circulant traveling salesman problem (CTSP) is the problem of finding a minimum weight Hamiltonian cycle in a weighted graph with circulant distance matrix. The computational complexity of this problem is not known.
Yang, QF, Burkard, R.E., Woeginger, G.J., Burkard, RE, Çela, E., Çela, Eranda, Woeginger, GJ Gerhard, Yang, Qi Fan, Burkard, Rainer E., Woeginger, Gerhard J., Yang, Q.F., Çela, E   +11 more
core   +1 more source

A Systematic Review of Approximability Results for Traveling Salesman Problems leveraging the TSP-T3CO Definition Scheme

The traveling salesman (or salesperson) problem, short TSP, is a problem of strong interest to many researchers from mathematics, economics, and computer science.
Koehler, Jana, Saller, Sophia, Karrenbauer, Andreas   +2 more
core   +2 more sources

An efficient heuristic for peak capture power minimization during scan-based test

, 2013
IR-Drop induced timing failures during testing can be avoided by minimizing the peak capturepower. This paper models the Capture-Power minimization problem as an instance of the Bottleneck Traveling Salesman Path Problem (BTSPP).
Sobhan Babu, Ch, Satya Trinadh, A, Potluri, S, Kamakoti, V   +3 more
core   +1 more source

Applications of an algebraic Monge property

, 1993
When restricted to cost arrays possessing the sum Monge property, many combinatorial optimization problems with sum objective functions become significantly easier to solve.
Brucker, P., Park, J. K., Bein, W. W.
core  

Um algoritmo evolutivo para a programação de projetos multi-modos com nivelamento de recursos limitado [PDF]

, 1995
Tese (doutorado) - Universidade Federal de Santa Catarina, Centro TecnologicoO problema de programação de projetos com restrição de recursos, é considerado um dos problemas mais desafiantes.
Lopez Vaca, Oscar Ciro
core  

Applications of Operations Research to A Check Processing System

, 1974
The subject of this thesis is the check processing system of a large commercial bank. The scientific method of analysis and synthesis are employed to identify the important aspects of the problem, to define the models, and their inter-relationships.
Svestka, Joseph A.
core  

Relaxing synchronization in distributed simulated annealing

, 1992
Simulated annealing is an attractive, but expensive, heuristic for approximating the solution to combinatorial optimization problems. Since simulated annealing is a general purpose method, it can be applied to the broad range of NP-complete problems such
Hong, Chul-Eui
core   +1 more source

Information-Theoretic Intrinsic Motivation for Reinforcement Learning in Combinatorial Routing. [PDF]

Entropy (Basel)
Xi R, Ni Y, Wu W.
europepmc   +1 more source

Optimizing Tourism Routes: A Quantum Approach to the Profitable Tour Problem. [PDF]

Entropy (Basel)
Cheng XS, Liu YH, Dong XH, Wang Y.
europepmc   +1 more source