An optimal algorithm for the mixed Chinese postman problem (Q4887738): Difference between revisions
From MaRDI portal
Changed an Item |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| label / en | label / en | ||
An optimal algorithm for the mixed Chinese postman problem | |||
| 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.1002/(sici)1097-0037(199603)27:2<97::aid-net1>3.0.co;2-8 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1968384435 / rank | |||
Normal rank | |||
| Property / title | |||
An optimal algorithm for the mixed Chinese postman problem (English) | |||
| Property / title: An optimal algorithm for the mixed Chinese postman problem (English) / rank | |||
Normal rank | |||
Latest revision as of 08:21, 30 July 2024
scientific article; zbMATH DE number 913346
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal algorithm for the mixed Chinese postman problem |
scientific article; zbMATH DE number 913346 |
Statements
5 August 1996
0 references
Chinese postman problem
0 references
Gomory cuts
0 references
blossom inequalities
0 references
balanced set constraints
0 references
An optimal algorithm for the mixed Chinese postman problem (English)
0 references
