Cross-entropy and rare events for maximal cut and partition problems
From MaRDI portal
Publication:4564818
DOI10.1145/511442.511444zbMath1390.90482OpenAlexW2089739565MaRDI QIDQ4564818
Publication date: 12 June 2018
Published in: ACM Transactions on Modeling and Computer Simulation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/511442.511444
Probabilistic models, generic numerical methods in probability and statistics (65C20) Combinatorial optimization (90C27)
Related Items
On the benefits of Laplace samples in solving a rare event problem using cross-entropy method, An incremental off-policy search in a model-free Markov decision process using a single sample path, An Incremental Fast Policy Search Using a Single Sample Path, Chance-constrained problems and rare events: an importance sampling approach, An adaptive zero-variance importance sampling approximation for static network dependability evaluation, Finding minimum label spanning trees using cross‐entropy method, Improved cross entropy algorithm for the optimum of charge planning problem, Hybridizing the cross-entropy method: An application to the max-cut problem, A cross entropy-lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setup times, The Gestalt heuristic: emerging abstraction to improve combinatorial search, A tutorial on the cross-entropy method, Solving the multidimensional assignment problem by a cross-entropy method, A cross entropy approach to design of reliable networks
