A recognition algorithm for permuted Demidenko matrices. Algorithm 1 takes as input a symmetric n × n matrix C, n ≥ 4 , and its size n, and checks the existence of a Demidenko permutation τ for C such that τ ( 1 ) = p and τ ( n ) = q for each fixed pair of indices p , q ∈ [ n ] , p ≠ q .
Feb 10, 2023 · The recognition of the permuted Demidenko matrices is relevant in the context of hard combinatorial optimization problems which become tractable ...
Feb 10, 2023 · The recognition of the permuted Demidenko matrices is relevant in the context of hard combinatorial optimization problems which become tractable ...
We solve the recognition problem for permuted Demidenko matrices. This problem is relevant in the context of hard combinatorial optimization problems ...
Request Changes to record. Abstract. We solve the recognition problem for permuted Demidenko matrices. This problem is relevant in the context of hard ...
The recognition of the permuted Demidenko matrices is relevant in the context of hard combinatorial optimization problems which become tractable if the input is ...
Recognising permuted Demidenko matrices. Eranda Çela *, Vladmir Deineko, Gerhard Johannes Wöginger. *Corresponding author for this work. Institute of Discrete ...
List of references · Burkard, Perspectives of Monge properties in optimization, Discrete Appl. · Burkard, Well-solvable special cases of the TSP: a survey, SIAM ...
The recognition of the permuted Demidenko matrices is relevant in the context of hard combinatorial optimization problems which become tractable if the input is ...
In this paper, we introduce the 1 − K robotic-cell scheduling problem, whose solution can be reduced to solving a TSP on specially structured permuted ...