A branch and cut approach to the cardinality constrained circuit problem. (Q5957568): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: TSPLIB / rank | |||
Normal rank | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: MINTO / 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.1007/s101070100209 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2097355722 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 19:05, 19 March 2024
scientific article; zbMATH DE number 1717673
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A branch and cut approach to the cardinality constrained circuit problem. |
scientific article; zbMATH DE number 1717673 |
Statements
A branch and cut approach to the cardinality constrained circuit problem. (English)
0 references
2002
0 references
circuit polytope
0 references
