Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Column generation approach to the convex recoloring problem on a tree

From MaRDI portal
Publication:1695079
Jump to:navigation, search

DOI10.1007/978-3-319-66616-7_3zbMath1380.05057OpenAlexW2767040551MaRDI QIDQ1695079

Ergin Erdem, Eun-Seok Kim, Sunil Chopra, Sang Ho Shim

Publication date: 6 February 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-66616-7_3


zbMATH Keywords

linear programmingcolumn generationbioinformaticsclustering problemphylogenetic treelarge scale optimizationconvex recoloring problemset partition problem


Mathematics Subject Classification ID

Linear programming (90C05) Combinatorial optimization (90C27) Coloring of graphs and hypergraphs (05C15)


Related Items (2)

Strong inequalities and a branch-and-price algorithm for the convex recoloring problem ⋮ A heuristic for the convex recoloring problem in graphs




This page was built for publication: Column generation approach to the convex recoloring problem on a tree

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1695079&oldid=14014416"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 06:49.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki