On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances (Q497453): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(8 intermediate revisions by 6 users not shown)
Property / author
 
Property / author: Thomas Stützle / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q59585904 / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: LKH / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Concorde / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11590-014-0828-5 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1983531822 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of clause-learning SAT solvers as resolution engines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the empirical scaling of run-time for finding optimal solutions to the travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4790380 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential Lower Bounds on the Lengths of Some Classes of Branch-and-Cut Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective implementation of the Lin-Kernighan traveling salesman heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: General \(k\)-opt submoves for the Lin-Kernighan TSP heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman. Computational solutions for RSP applications / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:12, 10 July 2024

scientific article
Language Label Description Also known as
English
On the empirical time complexity of finding optimal solutions vs proving optimality for Euclidean TSP instances
scientific article

    Statements

    Identifiers