A novel sampling approach to combinatorial optimization under uncertainty

DOI10.1023/A:1021866210039MaRDI QIDQ1866137zbMATH OpenFDO

Authors Urmila M. Diwekar

Publication date 3 April 2003

Published in Computational Optimization and Applications (Search for Journal in Brave)

zbMATH Keywords

combinatorial optimizationstochastic optimizationnuclear wasteefficient samplingHSS techniquestochastic annealing

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Stochastic programming (90C15)

Recommendations

• Optimization under uncertainty via random sampling of scenarios. I
• Sampling-based objective function evaluation techniques for the orienteering problem with stochastic travel and service times
• Tabu search when noise is present: An illustration in the context of cause and effect analysis
• The sample average approximation method for stochastic discrete optimization
• scientific article; zbMATH DE number 3924519

Cited in

(4)

• Sampling-based objective function evaluation techniques for the orienteering problem with stochastic travel and service times
• Alternative sampling strategy for a random optimization algorithm
• A simplex-based numerical framework for simple and efficient robust design optimization
• scientific article; zbMATH DE number 4168234 (Why is no real title available?)

This page was built for publication: A novel sampling approach to combinatorial optimization under uncertainty

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1866137)