The 2-path network problem (Q4474295): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| (One intermediate revision by one other user not shown) | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/net.20003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061552894 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Geometric algorithms and combinatorial optimization / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4040221 / rank | |||
Normal rank | |||
Latest revision as of 18:33, 6 June 2024
scientific article; zbMATH DE number 2081226
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The 2-path network problem |
scientific article; zbMATH DE number 2081226 |
Statements
The 2-path network problem (English)
0 references
4 August 2004
0 references
network design
0 references
cutting planes
0 references
polyhedral approach
0 references
