相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。An Integer Linear Programming approach to minimize the cost of the refurbishment of a facade to improve the energy efficiency of a building
Andrea Salandin et al.
MATHEMATICAL METHODS IN THE APPLIED SCIENCES (2020)
A multiperiod model for estimating the cost of deposit insurance under the Basel III minimum capital requirement
Grant E. Muller
MATHEMATICAL METHODS IN THE APPLIED SCIENCES (2020)
A beetle antennae search algorithm based on Levy flights and adaptive strategy
Xin Xu et al.
SYSTEMS SCIENCE & CONTROL ENGINEERING (2020)
BAS-ADAM: an ADAM based approach to improve the performance of beetle antennae search optimizer
Ameer Hamza Khan et al.
IEEE-CAA JOURNAL OF AUTOMATICA SINICA (2020)
A heuristic process on the existence of positive bases with applications to minimum-cost portfolio insurance in C[a, b]
Vasilios N. Katsikis et al.
APPLIED MATHEMATICS AND COMPUTATION (2019)
A portfolio selection model based on the knapsack problem under uncertainty
Fereshteh Vaezi et al.
PLOS ONE (2019)
A Novel Monarch Butterfly Optimization with Global Position Updating Operator for Large-Scale 0-1 Knapsack Problems
Yanhong Feng et al.
MATHEMATICS (2019)
The Importance of Transfer Function in Solving Set-Union Knapsack Problem Based on Discrete Moth Search Algorithm
Yanhong Feng et al.
MATHEMATICS (2019)
Enhanced Moth Search Algorithm for the Set-Union Knapsack Problems
Yanhong Feng et al.
IEEE ACCESS (2019)
Solving 0-1 knapsack problems by chaotic monarch butterfly optimization algorithm with Gaussian mutation
Yanhong Feng et al.
MEMETIC COMPUTING (2018)
Solving randomized time-varying knapsack problems by a novel global firefly algorithm
Yanhong Feng et al.
ENGINEERING WITH COMPUTERS (2018)
Multi-strategy monarch butterfly optimization algorithm for discounted {0-1} knapsack problem
Yanhong Feng et al.
NEURAL COMPUTING & APPLICATIONS (2018)
Opposition-based learning monarch butterfly optimization with Gaussian perturbation for large-scale 0-1 knapsack problem
Yanhong Feng et al.
COMPUTERS & ELECTRICAL ENGINEERING (2018)
Binary Moth Search Algorithm for Discounted {0-1} Knapsack Problem
Yan-Hong Feng et al.
IEEE ACCESS (2018)
Solving 0-1 knapsack problem by a novel binary monarch butterfly optimization
Yanhong Feng et al.
NEURAL COMPUTING & APPLICATIONS (2017)
A self-adaptive intelligence gray prediction model with the optimal fractional order accumulating operator and its application
Bo Zeng et al.
MATHEMATICAL METHODS IN THE APPLIED SCIENCES (2017)
A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems
Yanhong Feng et al.
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS (2016)
A Novel Hybrid Cuckoo Search Algorithm with Global Harmony Search for 0-1 Knapsack Problems
Yanhong Feng et al.
INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE SYSTEMS (2016)
Algorithms for randomized time-varying knapsack problems
Yichao He et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2016)
Optimal control problem for an insurance surplus model with debt liability
FanCheng Wei et al.
MATHEMATICAL METHODS IN THE APPLIED SCIENCES (2014)
Binary bat algorithm
Seyedali Mirjalili et al.
NEURAL COMPUTING & APPLICATIONS (2014)
S-shaped versus V-shaped transfer functions for binary Particle Swarm Optimization
Seyedali Mirjalili et al.
SWARM AND EVOLUTIONARY COMPUTATION (2013)
A New Multiagent Algorithm for Dynamic Continuous Optimization
Julien Lepagnot et al.
INTERNATIONAL JOURNAL OF APPLIED METAHEURISTIC COMPUTING (2010)
Minimum-cost portfolio insurance
CD Aliprantis et al.
JOURNAL OF ECONOMIC DYNAMICS & CONTROL (2000)
分享论文
