Sorting Permutations by Reversals Through Branch-and-Price

DOI10.1287/ijoc.13.3.224.12631zbMath1238.90100OpenAlexW2101128420MaRDI QIDQ2884508

See-Kiong Ng, Giuseppe Lancia, Alberto Caprara

Publication date: 30 May 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/789afea7bec53f538253f4d120e7b0b514e33538

zbMATH Keywords

integer programminggraph matchings

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (6)

On some optimization problems in molecular biology ⋮ Mathematical programming in computational biology: an annotated bibliography ⋮ A review of metrics on permutations for search landscape analysis ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ Deriving compact extended formulations via LP-based separation techniques ⋮ Non-cyclic train timetabling and comparability graphs

This page was built for publication: Sorting Permutations by Reversals Through Branch-and-Price