Pages that link to "Item:Q2567853"
From MaRDI portal
The following pages link to Rollout algorithms for combinatorial optimization (Q2567853):
Displaying 36 items.
- Conservative allocation models for outbound containers in container terminals (Q296714) (← links)
- Solving stochastic resource-constrained project scheduling problems by closed-loop approximate dynamic programming (Q319710) (← links)
- Paired cooperative reoptimization strategy for the vehicle routing problem with stochastic demands (Q337058) (← links)
- Robust flows with losses and improvability in evacuation planning (Q339930) (← links)
- Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
- Parallelization strategies for rollout algorithms (Q812417) (← links)
- Looking ahead with the pilot method (Q816423) (← links)
- Classification of applied methods of combinatorial optimization (Q844352) (← links)
- Approximate policy optimization and adaptive control in regression models (Q853656) (← links)
- A 2-OPT procedure to reduce total inspection time in a serial inspection process (Q877228) (← links)
- Applying the pilot method to improve VNS and GRASP metaheuristics for the design of SDH/WDM networks (Q932187) (← links)
- Hybrid rollout approaches for the job shop scheduling problem (Q1014017) (← links)
- Scheduling trains as a blocking parallel-machine job shop scheduling problem (Q1017462) (← links)
- A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
- An approximate dynamic programming approach for the vehicle routing problem with stochastic demands (Q1027533) (← links)
- Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands (Q1579026) (← links)
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs (Q1698902) (← links)
- Patient scheduling in hemodialysis service (Q1740427) (← links)
- Planning horizons based proactive rescheduling for stochastic resource-constrained project scheduling problems (Q1991259) (← links)
- From reinforcement learning to optimal control: a unified framework for sequential decisions (Q2094027) (← links)
- Rollout approach to sensor scheduling for remote state estimation under integrity attack (Q2165967) (← links)
- Managing mobile production-inventory systems influenced by a modulation process (Q2241563) (← links)
- An approximate dynamic programming approach to project scheduling with uncertain resource availabilities (Q2247268) (← links)
- Comparing heuristics for the product allocation problem in multi-level warehouses under compatibility constraints (Q2285897) (← links)
- Average-case performance of rollout algorithms for knapsack problems (Q2349849) (← links)
- Optimal allocation of heterogeneous resources in cooperative control scenarios (Q2390562) (← links)
- Augmenting priority rule heuristics with justification and rollout to solve the resource-constrained project scheduling problem (Q2482379) (← links)
- Dynamic programming and suboptimal control: a survey from ADP to MPC (Q2511993) (← links)
- Merchant Commodity Storage Practice Revisited (Q2795873) (← links)
- Benders Decomposition for Production Routing Under Demand Uncertainty (Q3465587) (← links)
- A two-phase heuristic algorithm for cell formation problems considering alternative part routes and machine sequences (Q4671299) (← links)
- New Rollout Algorithms for Combinatorial Optimization Problems (Q4709749) (← links)
- ExpertRNA: A New Framework for RNA Secondary Structure Prediction (Q5057995) (← links)
- A rollout algorithm for the resource constrained elementary shortest path problem (Q5198052) (← links)
- Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach (Q6109553) (← links)
- Novel models and algorithms for location assignment for outbound containers in container terminals (Q6112558) (← links)
