Pages that link to "Item:Q4530652"

The following pages link to Nested Partitions Method for Global Optimization (Q4530652):

Displaying 50 items.

• A discrete meta-control procedure for approximating solutions to binary programs (Q280551) (← links)
• Adaptive nested optimization scheme for multidimensional global search (Q330495) (← links)
• Stochastic resource allocation using a predictor-based heuristic for optimization via simulation (Q336991) (← links)
• A hybrid framework for optimizing beam angles in radiation therapy planning (Q490168) (← links)
• Population model-based optimization (Q496596) (← links)
• Quantifying heuristics in the ordinal optimization framework (Q609560) (← links)
• Continuous optimization via simulation using golden region search (Q621655) (← links)
• Dynamic sample budget allocation in model-based optimization (Q645551) (← links)
• Generalized surrogate problem methodology for online stochastic discrete optimization (Q700765) (← links)
• A hybrid of nested partition, binary ant system, and linear programming for the multidimensional knapsack problem (Q732881) (← links)
• Application of the cross-entropy method to clustering and vector quantization (Q868638) (← links)
• Dynamic emergency logistics planning: models and heuristic algorithm (Q895782) (← links)
• Differentiated service inventory optimization using nested partitions and MOCBA (Q959521) (← links)
• An incremental nested partition method for data clustering (Q969084) (← links)
• A survey on metaheuristics for stochastic combinatorial optimization (Q1024034) (← links)
• A peak-over-threshold search method for global optimization (Q1640234) (← links)
• An efficient simulation optimization method for the generalized redundancy allocation problem (Q1681168) (← links)
• Sensitivity-based nested partitions for solving finite-horizon Markov decision processes (Q1728313) (← links)
• Solving a class of simulation-based optimization problems using ``optimality in probability'' (Q1745940) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• Computing the optimal partition of variables in multi-homogeneous homotopy methods (Q1774889) (← links)
• Stochastic global optimization using tangent minorants for Lipschitz functions (Q1989202) (← links)
• An extended two-stage sequential optimization approach: properties and performance (Q2023982) (← links)
• Innovation performance evaluation for high-tech companies using a dynamic network data envelopment analysis approach (Q2030558) (← links)
• Nested partitions for the large-scale extended job shop scheduling problem (Q2271832) (← links)
• An optimization framework for solving capacitated multi-level lot-sizing problems with backlogging (Q2275834) (← links)
• An accelerated stopping rule for the nested partition hybrid algorithm for discrete stochastic optimization (Q2348379) (← links)
• Data mining-based dispatching system for solving the local pickup and delivery problem (Q2393491) (← links)
• Optimal design of personalized prostate cancer therapy using infinitesimal perturbation analysis (Q2406966) (← links)
• Convergence conditions and numerical comparison of global optimization methods based on dimensionality reduction schemes (Q2422874) (← links)
• Global optimization for possibly time-dependent cost functions by a population set-based algorithm with births control (Q2458532) (← links)
• Operations research and data mining (Q2467295) (← links)
• A tutorial on the cross-entropy method (Q2485925) (← links)
• Application of the cross-entropy method to the buffer allocation problem in a simulation-based environment (Q2485930) (← links)
• A new approach to discrete stochastic optimization problems (Q2488904) (← links)
• A sequential procedure for neighborhood selection-of-the-best in optimization via simulation (Q2491793) (← links)
• Optimization-based feature selection with adaptive instance sampling (Q2499140) (← links)
• A general framework on the simulation-based optimization under fixed computing budget (Q2503253) (← links)
• Algorithms for single-machine scheduling problem with deterioration depending on a novel model (Q2628177) (← links)
• Augmented simulation methods for discrete stochastic optimization with recourse (Q2678622) (← links)
• Empirical tail risk management with model-based annealing random search (Q2700078) (← links)
• A machine learning-based nested partitions framework for angle selection in radiotherapy (Q2829579) (← links)
• Application of Evolutionary Algorithms for Solving Multi-Objective Simulation Optimization Problems (Q3627781) (← links)
• Target-Hardening Decisions Based on Uncertain Multiattribute Terrorist Utility (Q4691944) (← links)
• Simulation Optimization for MRO Systems Operations (Q4978462) (← links)
• Technical Note—On Nested Partitions Method for Global Optimization (Q5031642) (← links)
• Plausible Screening Using Functional Properties for Simulations with Large Solution Spaces (Q5060518) (← links)
• Predictive Search for Capacitated Multi-Item Lot Sizing Problems (Q5084658) (← links)
• Yard Crane Scheduling in the Ground Trolley-Based Automated Container Terminal (Q5112420) (← links)
• Multiextremal Optimization in Feasible Regions with Computable Boundaries on the Base of the Adaptive Nested Scheme (Q5122280) (← links)