A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem (Q3091494): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62048288, #quickstatements; #temporary_batch_1703762337552 |
Created claim: DBLP publication ID (P1635): conf/inoc/LjubicPG11, #quickstatements; #temporary_batch_1731468600454 |
||
| (3 intermediate revisions by 3 users not shown) | |||
| 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.1007/978-3-642-21527-8_17 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W37272319 / rank | |||
Normal rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: conf/inoc/LjubicPG11 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 05:07, 13 November 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem |
scientific article |
Statements
A Heuristic Algorithm for a Prize-Collecting Local Access Network Design Problem (English)
0 references
9 September 2011
0 references
