Pages that link to "Item:Q1999008"
From MaRDI portal
The following pages link to Solving the traveling repairman problem with profits: a novel variable neighborhood search approach (Q1999008):
Displaying 12 items.
- Revenue maximization of Internet of things provider using variable neighbourhood search (Q2022217) (← links)
- Parallel iterative solution-based Tabu search for the obnoxious \(p\)-median problem (Q2027024) (← links)
- On solving the order processing in picking workstations (Q2070114) (← links)
- A general variable neighborhood search algorithm for a parallel-machine scheduling problem considering machine health conditions and preventive maintenance (Q2147013) (← links)
- A logic-based Benders decomposition method for the multi-trip traveling repairman problem with drones (Q2147137) (← links)
- An effective hybrid search algorithm for the multiple traveling repairman problem with profits (Q2171586) (← links)
- A variable neighborhood search algorithm for an integrated physician planning and scheduling problem (Q2676356) (← links)
- Variable Neighborhood Programming as a Tool of Machine Learning (Q5153506) (← links)
- Dynamic resource allocation and collaborative scheduling in R\&D and manufacturing processes of high-end equipment with budget constraint (Q6043112) (← links)
- Physician scheduling problem in mobile cabin hospitals of China during Covid-19 outbreak (Q6168128) (← links)
- A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles (Q6561246) (← links)
- The multiobjective traveling salesman-repairman problem with profits: design and implementation of a variable neighborhood descent algorithm for a real scenario (Q6609709) (← links)
