Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (Q1042104): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2008.11.027 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.11.027 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148127689 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2008.11.027 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2148127689 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simulated annealing for discrete optimization with estimation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Geometric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Priori Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5700829 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3500152 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Estimation-Based Local Search for Stochastic Combinatorial Optimization Using Delta Evaluations: A Case Study on the Probabilistic Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: MPFR / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Branch-and-Bound Approach to Activity Crashing in Project Management / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable-sample methods for stochastic optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5472387 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4365133 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A combined procedure for optimization via simulation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3311717 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2008.11.027 / rank
 
Normal rank

Latest revision as of 14:42, 10 December 2024

scientific article
Language Label Description Also known as
English
Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem
scientific article

    Statements

    Adaptive sample size and importance sampling in estimation-based local search for the probabilistic traveling salesman problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    7 December 2009
    0 references
    combinatorial optimization
    0 references
    heuristics
    0 references
    metaheuristics
    0 references
    iterative improvement algorithm
    0 references
    probabilistic traveling salesman problem
    0 references
    importance sampling
    0 references
    0 references
    0 references

    Identifiers