Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (Q653316): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.012 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1980537145 / rank | |||
Normal rank | |||
Revision as of 02:58, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem |
scientific article |
Statements
Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem (English)
0 references
9 January 2012
0 references
