Related references
Note: Only part of the references are listed.A hybrid population-based algorithm for the bi-objective quadratic multiple knapsack problem
Meziane Aider et al.
EXPERT SYSTEMS WITH APPLICATIONS (2022)
Maximum Target Coverage Problem in Mobile Wireless Sensor Networks
Dieyan Liang et al.
SENSORS (2021)
Multistart solution-based tabu search for the Set-Union Knapsack Problem
Zequn Wei et al.
APPLIED SOFT COMPUTING (2021)
A swarm intelligence-based algorithm for the set-union knapsack problem
Fehmi Burcin Ozsoydan et al.
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2019)
Maximum coverage capacitated facility location problem with range constrained drones
Darshan Chauhan et al.
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES (2019)
A hybrid binary particle swarm optimization with tabu search for the set-union knapsack problem
Geng Lin et al.
EXPERT SYSTEMS WITH APPLICATIONS (2019)
Estimation of Distribution Algorithm Based on Levy Flight for Solving the Set-Union Knapsack Problem
Xue-Jing Liu et al.
IEEE ACCESS (2019)
A novel binary artificial bee colony algorithm for the set-union knapsack problem
Yichao He et al.
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2018)
Adaptive feasible and infeasible tabu search for weighted vertex coloring
Wen Sun et al.
INFORMATION SCIENCES (2018)
A multi-start iterated local search algorithm for the generalized quadratic multiple knapsack problem
Mustafa Avci et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
An iterated hyperplane exploration approach for the quadratic knapsack problem
Yuning Chen et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
The Budgeted Maximum Coverage Problem in Partially Deployed Software Defined Networks
Binayak Kar et al.
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT (2016)
The Budgeted Maximum Coverage Problem in Partially Deployed Software Defined Networks
Binayak Kar et al.
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT (2016)
Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms
Celso C. Ribeiro et al.
JOURNAL OF GLOBAL OPTIMIZATION (2012)
Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
Krzysztof Fleszar et al.
COMPUTERS & OPERATIONS RESEARCH (2009)
The Generalized Maximum Coverage Problem
Reuven Cohen et al.
INFORMATION PROCESSING LETTERS (2008)
TTT plots: a perl program to create time-to-target plots
Renata M. Aiex et al.
OPTIMIZATION LETTERS (2007)
Locating network monitors: Complexity, heuristics, and coverage
Kyoungwon Suh et al.
COMPUTER COMMUNICATIONS (2006)
Benchmarking optimization software with performance profiles
ED Dolan et al.
MATHEMATICAL PROGRAMMING (2002)
Share Paper
