Lengths of tours and permutations on a vertex set of a convex polygon.

DOI10.1016/S0166-218X(01)00215-3zbMath1076.90068OpenAlexW2036650277MaRDI QIDQ5954238

Uehara Hideyuki, Ito Hiro, Yokoyama Mitsuo

Publication date: 15 July 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00215-3

zbMATH Keywords

convex polygonschord lengthconnected permutationslength of permutationstours

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorics in computer science (68R05) Permutations, words, matrices (05A05) Combinatorial optimization (90C27)

Related Items (3)

The Number of Flips Required to Obtain Non-crossing Convex Cycles ⋮ Two equivalent measures on weighted hypergraphs ⋮ Sum of edge lengths of a multigraph drawn on a convex polygon

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Lengths of tours and permutations on a vertex set of a convex polygon.