Pages that link to "Item:Q4897090"
From MaRDI portal
The following pages link to The <i>m</i>-Traveling Salesman Problem with Minmax Objective (Q4897090):
Displaying 15 items.
- A min-max vehicle routing problem with split delivery and heterogeneous demand (Q376008) (← links)
- A constant-factor approximation algorithm for multi-vehicle collection for processing problem (Q376011) (← links)
- Non-identical parallel-machine scheduling research with minimizing total weighted completion times: models, relaxations and algorithms (Q965714) (← links)
- An adaptive memory heuristic for a class of vehicle routing problems with minmax objective (Q1362944) (← links)
- Routing problems: A bibliography (Q1908308) (← links)
- Metaheuristics: A bibliography (Q1919858) (← links)
- Hybrid search with neighborhood reduction for the multiple traveling salesman problem (Q2146986) (← links)
- An effective iterated two-stage heuristic algorithm for the multiple traveling salesmen problem (Q2147041) (← links)
- A columnar competitive model for solving multi-traveling salesman problem (Q2482590) (← links)
- A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem (Q2496041) (← links)
- Min-Max vs. Min-Sum vehicle routing: a worst-case analysis (Q2629640) (← links)
- Modeling and optimization of multiple traveling salesmen problems: an evolution strategy approach (Q2668611) (← links)
- A binary search algorithm for the general coupled task scheduling problem (Q6057721) (← links)
- A matheuristic for the MinMax capacitated open vehicle routing problem (Q6066715) (← links)
- Memetic search for the minmax multiple traveling salesman problem with single and multiple depots (Q6167324) (← links)
