Pages that link to "Item:Q1200771"
From MaRDI portal
The following pages link to Traveling salesman problem under categorization (Q1200771):
Displaying 12 items.
- On discrete optimization with ordering (Q367635) (← links)
- Minmax combinatorial optimization (Q1130081) (← links)
- Erratum on: Travelling salesman problem under categorization (Q1317013) (← links)
- A fast and simple algorithm for the bottleneck biconnected spanning subgraph problem (Q1329426) (← links)
- Ordered weighted average optimization in multiobjective spanning tree problem (Q1753508) (← links)
- A linear time algorithm for the bottleneck biconnected spanning subgraph problem (Q1847357) (← links)
- Categorized bottleneck-minisum path problems on networks (Q1890954) (← links)
- Labeled traveling salesman problems: complexity and approximation (Q1952507) (← links)
- Minimizing the number of workers in a paced mixed-model assembly line (Q1991120) (← links)
- The Complexity of Bottleneck Labeled Graph Problems (Q3508579) (← links)
- (Q5389837) (← links)
- The complexity of bottleneck labeled graph problems (Q5961969) (← links)
