The simplified partial digest problem: approximation and a graph-theoretic model (Q621677): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: BGL / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2010.07.027 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2075410301 / rank | |||
Normal rank | |||
Latest revision as of 23:32, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The simplified partial digest problem: approximation and a graph-theoretic model |
scientific article |
Statements
The simplified partial digest problem: approximation and a graph-theoretic model (English)
0 references
28 January 2011
0 references
integer programming
0 references
genome mapping
0 references
combinatorial optimization
0 references
heuristics
0 references
approximation algorithms
0 references
