Entity usage

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

51. Data-driven optimization for seismic-resilient power network planning: Label: en
52. A feature correlation reinforce clustering and evolutionary algorithm for the green bike-sharing reposition problem: Label: en
53. A tight compact quadratically constrained convex relaxation of the optimal power flow problem: Label: en
54. Real-time schedule adjustments for conflict-free vehicle routing: Label: en
55. A chance-constrained optimization approach integrating project scheduling and material ordering to manage the uncertain material supply: Label: en
56. A branch-and-bound algorithm for the proactive resource-constrained project scheduling problem with a robustness maximization objective: Label: en
57. Drone-based hybrid charging for multiple sensors: a distributionally robust optimization approach: Label: en
58. Solving the set covering problem with conflicts on sets: a new parallel GRASP: Label: en
59. Dynamic exploration-exploitation Pareto approach for high-dimensional expensive black-box optimization: Label: en
60. Benders decomposition for the energy aware task scheduling of constellations of nanosatellites: Label: en
61. Due-date assignment with acceptable lead-times on parallel machines: Label: en
62. The dynamic facility location problem with mobile production units: a waste recycling application: Label: en
63. Benchmarking problems for robust discrete optimization: Label: en
64. Optimizing emergency supply pre-positioning for disaster relief: a two-stage distributionally robust approach: Label: en
65. Approximation algorithms for job scheduling with block-type conflict graphs: Label: en
66. A fast path relinking algorithm for the min-max edge crossing problem: Label: en
67. A matheuristic for locating obnoxious facilities: Label: en
68. A branch-and-cut approach to solve the fault diagnosis problem with lazy spread and imperfect system information: Label: en
69. A branch, bound and remember algorithm for maximizing the production rate in the simple assembly line balancing problem: Label: en
70. Heuristic and metaheuristic procedures for the parallel assembly lines balancing problem with multi-line workstations and buffer sizing: Label: en
71. Reentrant open shop scheduling problem with time lags and no-wait constraints: Label: en
72. Quick response under strategic consumers with high-price and stockout regrets: Label: en
73. Model and metaheuristic for human-robot collaboration assembly line worker assignment and balancing problem: Label: en
74. A proactive aircraft recovery approach based on airport spatiotemporal network supply and demand coordination: Label: en
75. A variable neighborhood search approach for solving a real-world hierarchical multi-echelon vehicle routing problem involving HCT vehicles: Label: en
76. Supplier selection under disruption risk with hybrid procurement: Label: en
77. Nesting and scheduling optimization of additive manufacturing systems: mapping the territory: Label: en
78. A comparison of alternative models for solving a non-linear single plant hydro unit commitment problem: Label: en
79. A parallel variable neighborhood search for \(\alpha\)-neighbor facility location problems: Label: en
80. A ride time-oriented scheduling algorithm for dial-a-ride problems: Label: en
81. The impact of partial production capacity sharing via production as a service: Label: en
82. Solving unconstrained binary polynomial programs with limited reach: application to low autocorrelation binary sequences: Label: en
83. Shore hydrogen deployment problem in green ports: Label: en
84. General variable neighborhood search for the optimization of software quality: Label: en
85. A comparative study of alternative formulations for the periodic vehicle routing problem: Label: en
86. Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators: Label: en
87. An improved column-generation-based matheuristic for learning classification trees: Label: en
88. The costs of overcrowding (and release): strategic discharges for isolated facilities during epidemiological outbreaks: Label: en
89. Optimal resource allocation and routing in robotic mobile fulfillment systems: Label: en
90. A parallel branch-and-bound heuristic for the integrated long-haul and local vehicle routing problem on an adaptive transportation network: Label: en
91. Robust optimization for a steel production planning problem with uncertain demand and product substitution: Label: en
92. Reducing the feasible solution space of resource-constrained project instances: Label: en
93. Optimal-transport satisficing with applications to capacitated hub location: Label: en
94. Optimizing high-speed railway express system under uncertainty: Label: en
95. Deep clustering of the traveling salesman problem to parallelize its solution: Label: en
96. Minimizing passenger waiting time in the multi-route bus fleet allocation problem through distributionally robust optimization and reinforcement learning: Label: en
97. Multi-period fourth-party logistics network design with the temporary outsourcing service under demand uncertainty: Label: en
98. A discrete group teaching optimization algorithm for solving many-objective sand casting whole process production scheduling problem: Label: en
99. Routing one million customers in a handful of minutes: Label: en
100. Exact and heuristic solution approaches for the generalized independent set problem: Label: en