Suchergebnisse - approximate statistical (dynamic OR dynamik) programming algorithm*

  1. 1

    New integer optimization models and an approximate dynamic programming algorithm for the lot-sizing and scheduling problem with sequence-dependent setups von Lee, Younsoo, Lee, Kyungsik

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Elsevier B.V 01.10.2022
    Veröffentlicht in European journal of operational research (01.10.2022)
    “… •An ADP algorithm based on the time-flow model is also proposed.•The proposed algorithm shows computational benefits over the standard MIP solver …”
    Volltext
    Journal Article
  2. 2

    Application of quantum approximate optimization algorithm to job shop scheduling problem von Kurowski, Krzysztof, Pecyna, Tomasz, Slysz, Mateusz, Różycki, Rafał, Waligóra, Grzegorz, Wȩglarz, Jan

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Elsevier B.V 16.10.2023
    Veröffentlicht in European journal of operational research (16.10.2023)
    “… •Demonstrate how to efficiently apply Quantum Approximate Optimization Algorithm (QAOA …”
    Volltext
    Journal Article
  3. 3

    A Randomized Exchange Algorithm for Computing Optimal Approximate Designs of Experiments von Harman, Radoslav, Filová, Lenka, Richtárik, Peter

    ISSN: 0162-1459, 1537-274X
    Veröffentlicht: Alexandria Taylor & Francis 02.01.2020
    Veröffentlicht in Journal of the American Statistical Association (02.01.2020)
    “… We propose a class of subspace ascent methods for computing optimal approximate designs that covers existing algorithms as well as new and more efficient ones …”
    Volltext
    Journal Article
  4. 4

    Surgical scheduling under uncertainty by approximate dynamic programming von Silva, Thiago A.O., de Souza, Mauricio C.

    ISSN: 0305-0483, 1873-5274
    Veröffentlicht: Elsevier Ltd 01.09.2020
    Veröffentlicht in Omega (Oxford) (01.09.2020)
    “… •We propose approximate dynamic programming with integer programming model.•It meets practical needs of monitoring surgical scheduling on the short-term …”
    Volltext
    Journal Article
  5. 5

    An actor-critic algorithm with policy gradients to solve the job shop scheduling problem using deep double recurrent agents von Monaci, Marta, Agasucci, Valerio, Grani, Giorgio

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Elsevier B.V 01.02.2024
    Veröffentlicht in European journal of operational research (01.02.2024)
    “… In this work, we present a method that applies Deep Reinforcement Learning, an approximate dynamic programming procedure using deep neural networks, to the job shop scheduling problem (JSSP …”
    Volltext
    Journal Article
  6. 6

    A fix and optimize method based approximate dynamic programming approach for the strategic fleet sizing and delivery planning problem von Aghazadeh, Duygu, Ertogral, Kadir

    ISSN: 1435-246X, 1613-9178
    Veröffentlicht: Berlin/Heidelberg Springer Berlin Heidelberg 01.03.2025
    Veröffentlicht in Central European journal of operations research (01.03.2025)
    “… In this study, we suggest an approximate Dynamic Programming algorithm, with a look ahead strategy, that uses the fix and optimize method as the imbedded heuristic for solving integrated fleet …”
    Volltext
    Journal Article
  7. 7

    Efficient algorithms of pathwise dynamic programming for decision optimization in mining operations von Hinz, Juri, Tarnopolskaya, Tanya, Yee, Jeremy

    ISSN: 0254-5330, 1572-9338
    Veröffentlicht: New York Springer US 01.03.2020
    Veröffentlicht in Annals of operations research (01.03.2020)
    “… We describe efficient algorithms for obtaining approximate solutions along with a diagnostic technique, which provides a quantitative measure for solution performance in terms of the distance …”
    Volltext
    Journal Article
  8. 8

    Approximate dynamic programming methods in Bayesian preference elicitation von Fisher, William, Zhang, Qiong, Song, Yongjia

    ISSN: 0898-2112, 1532-4222
    Veröffentlicht: Taylor & Francis 03.07.2025
    Veröffentlicht in Quality engineering (03.07.2025)
    “… Bayesian preference elicitation is a statistical framework which can aid in complex decision making processes such as engineering design by offering preference-informed recommendations to a decision maker (DM …”
    Volltext
    Journal Article
  9. 9

    A Bayesian Machine Learning Approach for Optimizing Dynamic Treatment Regimes von Murray, Thomas A., Yuan, Ying, Thall, Peter F.

    ISSN: 0162-1459, 1537-274X, 1537-274X
    Veröffentlicht: United States Taylor & Francis 03.07.2018
    Veröffentlicht in Journal of the American Statistical Association (03.07.2018)
    “… These decisions can be formalized as a dynamic treatment regime. This article describes a new approach for optimizing dynamic treatment regimes, which bridges the gap between Bayesian inference and existing approaches, like Q-learning …”
    Volltext
    Journal Article
  10. 10

    New efficient algorithms for multiple change-point detection with reproducing kernels von Celisse, A., Marot, G., Pierre-Jean, M., Rigaill, G.J.

    ISSN: 0167-9473, 1872-7352
    Veröffentlicht: Elsevier B.V 01.12.2018
    Veröffentlicht in Computational statistics & data analysis (01.12.2018)
    “… Several statistical approaches based on reproducing kernels have been proposed to detect abrupt changes arising in the full distribution of the observations and not only in the mean or variance …”
    Volltext
    Journal Article
  11. 11

    Performance Analysis of RIS-Aided THz Wireless Systems over α-μ Fading: An Approximate Closed-Form Approach von Le, Ngoc Phuc, Alouini, Mohamed-Slim

    ISSN: 2327-4662, 2327-4662
    Veröffentlicht: Piscataway IEEE 01.01.2024
    Veröffentlicht in IEEE internet of things journal (01.01.2024)
    “… variates based on the Gauss-Laguerre quadrature and a moment-matching method. This approximate approach facilitates analysis of the RIS-THz system over α-μ fading channels …”
    Volltext
    Journal Article
  12. 12

    Topology and Energy Aware Approximate Algorithm for QoS-Based Resource Slicing in 5G Core Networks von Sargolzaei, Ehsan, Rasti, Mehdi, Khorsandi, Siavash

    ISSN: 2169-3536, 2169-3536
    Veröffentlicht: Piscataway IEEE 2025
    Veröffentlicht in IEEE access (2025)
    “… Given the dynamic nature of 5G core networks, where bandwidth and CPU processing demands fluctuate due to time-varying demand, user mobility, diverse QoS requirements, potential link failures, server …”
    Volltext
    Journal Article
  13. 13

    Neural-Network-Based Online HJB Solution for Optimal Robust Guaranteed Cost Control of Continuous-Time Uncertain Nonlinear Systems von Liu, Derong, Wang, Ding, Wang, Fei-Yue, Li, Hongliang, Yang, Xiong

    ISSN: 2168-2267, 2168-2275, 2168-2275
    Veröffentlicht: United States IEEE 01.12.2014
    Veröffentlicht in IEEE transactions on cybernetics (01.12.2014)
    “… In this paper, the infinite horizon optimal robust guaranteed cost control of continuous-time uncertain nonlinear systems is investigated using …”
    Volltext
    Journal Article
  14. 14
  15. 15

    Best possible algorithms for online scheduling on identical batch machines with periodic pulse interruptions von Lin, Ran, Wang, Jun-Qiang, Liu, Zhixin, Xu, Jun

    ISSN: 0377-2217, 1872-6860
    Veröffentlicht: Elsevier B.V 16.08.2023
    Veröffentlicht in European journal of operational research (16.08.2023)
    “… •Design the best possible online algorithms using a waiting strategy.•Prove the competitive ratios of the online algorithms …”
    Volltext
    Journal Article
  16. 16

    Skewer: a fast and accurate adapter trimmer for next-generation sequencing paired-end reads von Jiang, Hongshan, Lei, Rong, Ding, Shou-Wei, Zhu, Shuifang

    ISSN: 1471-2105, 1471-2105
    Veröffentlicht: London BioMed Central 12.06.2014
    Veröffentlicht in BMC bioinformatics (12.06.2014)
    “… Background Adapter trimming is a prerequisite step for analyzing next-generation sequencing (NGS) data when the reads are longer than the target DNA/RNA …”
    Volltext
    Journal Article
  17. 17

    Balancing resources for dynamic vehicle routing with stochastic customer requests von Soeffker, Ninja, Ulmer, Marlin W, Mattfeld, Dirk C

    ISSN: 1436-6304, 0171-6468, 1436-6304
    Veröffentlicht: Berlin, Heidelberg Springer 01.06.2024
    Veröffentlicht in OR Spectrum (01.06.2024)
    “… During execution, new dynamic service requests occur, e.g., for parcel pickup. The goal of the service provider is to serve as many dynamic requests as possible while ensuring service of all initial customers …”
    Volltext
    Journal Article
  18. 18

    Reinforcement learning with dynamic convex risk measures von Coache, Anthony, Jaimungal, Sebastian

    ISSN: 0960-1627, 1467-9965
    Veröffentlicht: Oxford Blackwell Publishing Ltd 01.04.2024
    Veröffentlicht in Mathematical finance (01.04.2024)
    “… ‐consistent dynamic programming principle to determine the value of a particular policy, and develop policy gradient update rules that aid in obtaining optimal policies …”
    Volltext
    Journal Article
  19. 19

    Detection of Multiple Structural Breaks in Large Covariance Matrices von Li, Yu-Ning, Li, Degui, Fryzlewicz, Piotr

    ISSN: 0735-0015, 1537-2707
    Veröffentlicht: Alexandria Taylor & Francis 03.07.2023
    Veröffentlicht in Journal of business & economic statistics (03.07.2023)
    “… This article studies multiple structural breaks in large contemporaneous covariance matrices of high-dimensional time series satisfying an approximate factor model …”
    Volltext
    Journal Article
  20. 20

    An approximate algorithm for the two-dimensional air cargo revenue management problem von Huang, Kuancheng, Chang, Ko-chen

    ISSN: 1366-5545, 1878-5794
    Veröffentlicht: Exeter Elsevier India Pvt Ltd 01.05.2010
    “… For the air cargo revenue management problem, this study developed a solution algorithm based on approximating the expected revenue function in the dynamic programming (DP …”
    Volltext
    Journal Article