Sorting permutations by reversals through branch-and-price

DOI10.1287/IJOC.13.3.224.12631zbMATH Open1238.90100OpenAlexW2101128420MaRDI QIDQ2884508FDOQ2884508

Authors: Alberto Caprara, Giuseppe Lancia, See-Kiong Ng 

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

Recommendations

• scientific article; zbMATH DE number 1301598
• Sorting circular permutations by reversal.
• Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement
• Sorting signed permutations by reversals, revisited
• scientific article; zbMATH DE number 1947393

zbMATH Keywords

integer programminggraph matchings

Mathematics Subject Classification ID

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

Cited In (9)

• Title not available (Why is that?)
• On some optimization problems in molecular biology
• Sorting of Permutations by Cost-Constrained Transpositions
• A review of metrics on permutations for search landscape analysis
• Deriving compact extended formulations via LP-based separation techniques
• Non-cyclic train timetabling and comparability graphs
• Using Four Cost Measures to Determine Arc Reversal Orderings
• Deriving compact extended formulations via LP-based separation techniques
• Mathematical programming in computational biology: an annotated bibliography

This page was built for publication: Sorting permutations by reversals through branch-and-price

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