Separating subadditive Euclidean functionals

DOI10.1002/RSA.20706MaRDI QIDQ5371140zbMATH OpenOpenAlexFDO

Authors Wesley Pegden, Alan Frieze

Publication date 24 October 2017

Published in Random Structures \& Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/rsa.20706

zbMATH Keywords

Euclidean functionalstraveling salesperson problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Separating subadditive Euclidean functionals
• Probabilistic Analysis of the Held and Karp Lower Bound for the Euclidean Traveling Salesman Problem
• A Priori Bounds on the Euclidean Traveling Salesman
• scientific article; zbMATH DE number 176071
• How Long Can a Euclidean Traveling Salesman Tour Be?

Cited in

(4)

• scientific article; zbMATH DE number 3895652 (Why is no real title available?)
• Lower Bounds for Insertion Methods for TSP
• Separating subadditive Euclidean functionals
• Aspects of a randomly growing cluster in \(\mathbb{R}^d\), \(d \geq 2\)

This page was built for publication: Separating subadditive Euclidean functionals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5371140)