| Display title | A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery |
| Default sort key | 705506 |
| Page length (in bytes) | 15 |
| Namespace ID | 4206 |
| Namespace | Publication |
| Page ID | 8795178 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page views in the past month | 0 |
| MaRDI portal item ID | Q705506 |
| Central description | scientific article; zbMATH DE number 2131577 |
| Edit | Allow only users with "overwriteprofilepages" permission (infinite) |
| Move | Allow only users with "overwriteprofilepages" permission (infinite) |
| Page creator | Import240129110113 (talk | contribs) |
| Date of page creation | 09:57, 30 January 2024 |
| Latest editor | Import240129110113 (talk | contribs) |
| Date of latest edit | 09:57, 30 January 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
| Transcluded templates (17) | Pages included on this page:
|
| MaRDI portal entities used in this page | |
