Entity usage

Showing below up to 50 results in range #1 to #50.

1. Recoverable robust shortest path problem under interval budgeted uncertainty representations: Label: en
2. Layered graph models for the electric vehicle routing problem with nonlinear charging functions: Label: en
3. A metaheuristic algorithm for large maximum weight independent set problems: Label: en
4. A general label setting algorithm and tractability analysis for the multiobjective temporal shortest path problem: Label: en
5. Optimal error-detection system for identifying codes: Label: en
6. The workforce scheduling and routing problem with park-and-loop: Label: en
7. Multistage stochastic programming for integrated network optimization in hurricane relief logistics and evacuation planning: Label: en
8. Finding conserved low-diameter subgraphs in social and biological networks: Label: en
9. A survey on optimization studies of group centrality metrics: Label: en
10. A dynamic programming algorithm for order picking in robotic mobile fulfillment systems: Label: en
11. Selecting fast algorithms for the capacitated vehicle routing problem with machine learning techniques: Label: en
12. A heuristic with a performance guarantee for the commodity constrained split delivery vehicle routing problem: Label: en
13. Three network design problems for community energy storage: Label: en
14. Monte Carlo tree search for dynamic shortest-path interdiction: Label: en
15. Algorithmic solutions for maximizing shareable costs: Label: en
16. Reducing police response times: optimization and simulation of everyday police patrol: Label: en
17. A real-life study on the value of integrated optimization in order picking operations under dynamic order arrivals: Label: en
18. A new linear path pair availability constraint for network design: Label: en
19. A practical and robust approach for solving the multi-compartment vehicle routing problem under demand uncertainty using machine learning: Label: en
20. Identifying critical demand scenarios for the robust capacitated network design problem using principal component analysis: Label: en
21. Getting linear time in graphs of bounded neighborhood diversity: Label: en
22. A cops and robber game and the meeting time of synchronous directed walks: Label: en
23. A warehouse location-allocation bilevel problem that considers inventory policies: Label: en
24. A robust optimization framework for two-echelon vehicle and UAV routing for post-disaster humanitarian logistics operations: Label: en
25. Network design with vulnerability constraints and probabilistic edge reliability: Label: en
26. A flow-based ascending auction to compute buyer-optimal Walrasian prices: Label: en
27. Selectively closing recycling centers in Bavaria: reforming waste-management policy to reduce disparity: Label: en
28. Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs: Label: en
29. Maximum flow-based formulation for the optimal location of electric vehicle charging stations: Label: en
30. Collaborative transportation for attended home deliveries: Label: en
31. Heuristic reoptimization of time-extended multi-robot task allocation problems: Label: en
32. New approximations for network reliability: Label: en
33. Solving the probabilistic drone routing problem: searching for victims in the aftermath of disasters: Label: en
34. Enhanced methods for the weight constrained shortest path problem: Label: en
35. An improved hybrid genetic search with data mining for the CVRP: Label: en
36. Virtual network function reconfiguration in 5G networks: an optimization perspective: Label: en
37. Integrated commercial and operations planning model for schedule design, aircraft rotation and crew scheduling in airlines: Label: en
38. Algorithms and complexity for the almost equal maximum flow problem: Label: en
39. On the complexity of the upgrading version of the maximal covering location problem: Label: en
40. Toward fault-tolerant multi-robot networks: Label: en
41. Protection strategies for virtual network functions placement and service chains provisioning: Label: en
42. Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks: Label: en
43. Robust spectrum allocation in elastic flexgrid optical networks: complexity and formulations: Label: en
44. Unambiguous switching link group failure localization in all-optical networks: Label: en
45. Toward fast calculation of communication paths for resilient routing: Label: en
46. Efficient heuristics for determining node-disjoint path pairs visiting specified nodes: Label: en
47. Factorization and exact evaluation of the source-terminal diameter-constrained reliability: Label: en
48. Preface: design of resilient communication networks: Label: en
49. New path elimination constraints for multi-depot routing problems: Label: en
50. Dissimilar arc routing problems: Label: en