A branch-and-cut algorithm for the plant-cycle location problem (Q4661044): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (3 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: ABACUS / 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.1057/palgrave.jors.2601692 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1970975943 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 14:33, 19 March 2024
scientific article; zbMATH DE number 2151538
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch-and-cut algorithm for the plant-cycle location problem |
scientific article; zbMATH DE number 2151538 |
Statements
A branch-and-cut algorithm for the plant-cycle location problem (English)
0 references
4 April 2005
0 references
optimization
0 references
mathematical programming
0 references
telecommunications
0 references
