Efficiently solvable special cases of hard combinatorial optimization problems (Q1365047): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially solvable cases of the traveling salesman problem and a new exponential neighborhood / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4369631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cut and patch Steiner trees for ladders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives of Monge properties in optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal conditions for algebraic travelling salesman problems to be efficiently solvable / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of circular decomposable metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Trees on a Checkerboard / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Trees for Ladders / rank
 
Normal rank
Property / cites work
 
Property / cites work: Halin graphs and the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the recognition of permuted Supnick and incomplete Monge matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4193256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner minimal trees for regular polygons / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequence comparison with mixed convex and concave costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Travelling Salesman Model for the Sequencing of Duties in Bus Crew Rotas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Permutational extreme values of autocorrelation coefficients and a Pitman test against serial dependence / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primer of the Euclidean Steiner problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A special case of the \(n\)-vertex traveling-salesman problem that can be solved in O(\(n\)) time / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Product Matrix Traveling Salesman Problem: An Application and Solution Heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic assignment problems on series-parallel digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recognition of \(d\)-dimensional Monge arrays / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932608 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner problem in Halin networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian cycles in circulant digraphs with two stripes / rank
 
Normal rank

Latest revision as of 18:28, 27 May 2024

scientific article
Language Label Description Also known as
English
Efficiently solvable special cases of hard combinatorial optimization problems
scientific article

    Statements

    Efficiently solvable special cases of hard combinatorial optimization problems (English)
    0 references
    0 references
    0 references
    28 August 1997
    0 references
    0 references
    0 references
    0 references
    0 references
    survey
    0 references
    polynomially solvable special cases
    0 references
    travelling salesman
    0 references
    quadratic assignment
    0 references
    Steiner tree
    0 references
    recognition algorithms
    0 references
    0 references
    0 references
    0 references
    0 references