A MIP-based approach to solve the prize-collecting local access network design problem (Q2256343): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q62048271, #quickstatements; #temporary_batch_1710328330639 |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.ejor.2013.11.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071020517 / rank | |||
Normal rank | |||
Revision as of 00:41, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A MIP-based approach to solve the prize-collecting local access network design problem |
scientific article |
Statements
A MIP-based approach to solve the prize-collecting local access network design problem (English)
0 references
19 February 2015
0 references
network loading
0 references
local access
0 references
prize-collecting
0 references
matheuristic algorithm
0 references
