The following pages link to Majid Salari (Q323481):
Displayed 17 items.
- A practical vehicle routing problem with desynchronized arrivals to depot (Q323484) (← links)
- A bi-level programming model for protection of hierarchical facilities under imminent attacks (Q342087) (← links)
- An integer linear programming based heuristic for the capacitated \(m\)-ring-star problem (Q439317) (← links)
- An iterated local search for the budget constrained generalized maximal covering location problem (Q483216) (← links)
- A heuristic procedure for the capacitated \(m\)-ring-star problem (Q613432) (← links)
- Variable neighborhood search for the cost constrained minimum label spanning tree and label constrained minimum spanning tree problems (Q976011) (← links)
- An ILP improvement procedure for the open vehicle routing problem (Q991364) (← links)
- The time constrained maximal covering salesman problem (Q1631991) (← links)
- The open vehicle routing problem with decoupling points (Q1681358) (← links)
- An integer programming-based local search for the covering salesman problem (Q1761202) (← links)
- Selective capacitated location-routing problem with incentive-dependent returns in designing used products collection network (Q1991177) (← links)
- A bi-level model and solution methods for partial interdiction problem on capacitated hierarchical facilities (Q2337397) (← links)
- A hybrid metaheuristic algorithm for the multi-depot covering tour vehicle routing problem (Q2630221) (← links)
- The Generalized Covering Salesman Problem (Q2815466) (← links)
- A Variable Neighborhood Search and its Application to a Ring Star Problem Generalization (Q2883580) (← links)
- (Q5488956) (← links)
- Solution of minimum spanning forest problems with reliability constraints (Q6324863) (← links)