A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem (Q2253409): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 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.1016/j.ejor.2012.07.042 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1973050546 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 01:50, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem |
scientific article |
Statements
A branch-and-cut algorithm for the discrete \((r| p)\)-centroid problem (English)
0 references
27 July 2014
0 references
integer programming
0 references
competitive location
0 references
\((r| p)\)-centroid problem
0 references