Extreme Hamiltonian lines
From MaRDI portal
Cited in
(30)- Universal conditions for algebraic travelling salesman problems to be efficiently solvable
- Spanning trees and shortest paths in Monge graphs
- A comment on consecutive-2-out-of-\(n\) systems
- Recognising permuted Demidenko matrices
- Monge properties, discrete convexity and applications
- Using well-solvable quadratic assignment problems for VLSI interconnect applications
- Monge matrices make maximization manageable
- Efficiently solvable special cases of bottleneck travelling salesman problems
- A remark about A comment on consecutive-2-out-of-n systems
- Optimal wire ordering and spacing in low power semiconductor design
- The cone of Monge matrices: Extremal rays and applications
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
- New special cases of the quadratic assignment problem with diagonally structured coefficient matrices
- On the traveling salesman problem with a relaxed Monge matrix
- Traveling salesman games with the Monge property
- Another well-solvable case of the QAP: maximizing the job completion time variance
- The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: easy and hard cases
- Extreme Hamiltonian Circuits. Resolution of the Convex-Odd Case
- Extreme Hamiltonian Circuits. Resolution of the Convex-Even Case
- The assignment problem with nearly Monge arrays and incompatible partner indices
- A general approach to avoiding two by two submatrices
- Perspectives of Monge properties in optimization
- The maximum travelling salesman problem on symmetric Demidenko matrices
- Special cases of travelling salesman problems and heuristics
- Extrema concerning polygons in space-time
- The multi-stripe travelling salesman problem
- Generalisations of the Gilmore-Gomory traveling salesman problem and the Gilmore-Gomory scheme: a survey
- Subclasses of solvable problems from classes of combinatorial optimization problems
- A Note On Kalmanson Matrices∗
- Four-point conditions for the TSP: the complete complexity classification
This page was built for publication: Extreme Hamiltonian lines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q768985)
