Entity usage

Showing below up to 50 results in range #51 to #100.

51. Optimal decision-making of mutual fund temporary borrowing problem via approximate dynamic programming: Label: en
52. Efficient GRASP solution approach for the prisoner transportation problem: Label: en
53. Spatial optimization of multiple area land acquisition: Label: en
54. Formulations and an adaptive large neighborhood search for just-in-time scheduling of unrelated parallel machines with a common due window: Label: en
55. Optimization of the cutting process integrated to the lot sizing in multi-plant paper production industries: Label: en
56. Exact and approximate determination of the Pareto front using minimal correction subsets: Label: en
57. A vertex-separator-based integer linear programming formulation for the partitioned Steiner tree problem: Label: en
58. Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems: Label: en
59. Simultaneous predictive maintenance and inventory policy in a continuously monitoring system using simulation optimization: Label: en
60. Compromise policy for multi-stage stochastic linear programming: variance and bias reduction: Label: en
61. Shortest paths with exclusive-disjunction arc pairs conflicts: Label: en
62. Logic-based Benders decomposition for the preemptive flexible job-shop scheduling problem: Label: en
63. Dynamic unsplittable flows with path-change penalties: new formulations and solution schemes for large instances: Label: en
64. On optimal regression trees to detect critical intervals for multivariate functional data: Label: en
65. Wasserstein distributionally robust chance-constrained program with moment information: Label: en
66. Ensemble framework for causality learning with heterogeneous directed acyclic graphs through the lens of optimization: Label: en
67. Continuous-time formulations for multi-mode project scheduling: Label: en
68. A branch-and-price-and-cut algorithm for operating room scheduling under human resource constraints: Label: en
69. A novel optimization approach towards improving separability of clusters: Label: en
70. A solution technique for capacitated two-level hierarchical time minimization transportation problem: Label: en
71. Optimization of two-echelon last-mile delivery via cargo tunnel and a delivery person: Label: en
72. Learning-augmented heuristics for scheduling parallel serial-batch processing machines: Label: en
73. Iterated dynamic neighborhood search for packing equal circles on a sphere: Label: en
74. Design of survivable wireless backhaul networks with reliability considerations: Label: en
75. Robust optimization for the electric vehicle pickup and delivery problem with time windows and uncertain demands: Label: en
76. Resources synchronization in a full truckload pickup and delivery problem: an exact approach: Label: en
77. Two-stage international portfolio models with higher moment risk measures: Label: en
78. A large neighbourhood search algorithm for solving container loading problems: Label: en
79. Eco-routing problem for the delivery of perishable products: Label: en
80. An efficient local search algorithm for minimum positive influence dominating set problem: Label: en
81. Tight lower bounds for the traveling salesman problem with draft limits: Label: en
82. Generalized Nash equilibrium models for asymmetric, non-cooperative games on line graphs: application to water resource systems: Label: en
83. Flowshop with additional resources during setups: mathematical models and a GRASP algorithm: Label: en
84. Machine learning augmented approaches for hub location problems: Label: en
85. A three-phase heuristic for the fairness-oriented crew rostering problem: Label: en
86. On clustering and interpreting with rules by means of mathematical optimization: Label: en
87. Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach: Label: en
88. Refined bounds for the non-Archimedean \(\epsilon\) in DEA: Label: en
89. Robust homecare service capacity planning: Label: en
90. Branch-and-price algorithms for large-scale mission-oriented maintenance planning problems: Label: en
91. Dynamic shop-floor scheduling using real-time information: a case study from the thermoplastic industry: Label: en
92. Minimizing tardiness scheduling measures with generalized due-dates and a maintenance activity: Label: en
93. Comparing two SVM models through different metrics based on the confusion matrix: Label: en
94. A chance-constraint optimization model for a multi-echelon multi-product closed-loop supply chain considering brand diversity: an accelerated Benders decomposition algorithm: Label: en
95. A sampling-based matheuristic for the continuous-time stochastic inventory routing problem with time-windows: Label: en
96. An improved memetic algorithm for integrated production scheduling and vehicle routing decisions: Label: en
97. Home healthcare staff dimensioning problem for temporary caregivers: a matheuristic solution approach: Label: en
98. A neural network approach to performance analysis of tandem lines: the value of analytical knowledge: Label: en
99. The vehicle routing problem with drones and drone speed selection: Label: en
100. Optimizing a multi-echelon location-inventory problem with joint replenishment: a Lipschitz \(\epsilon\)-optimal approach using Lagrangian relaxation: Label: en