相关参考文献
注意：仅列出部分参考文献，下载原文获取全部文献信息。A new combinatorial branch-and-bound algorithm for the Knapsack Problem with Conflicts
Stefano Coniglio et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2021)
Multistart solution-based tabu search for the Set-Union Knapsack Problem
Zequn Wei et al.
APPLIED SOFT COMPUTING (2021)
Bin Packing Problem with Conflicts and Item Fragmentation
Ali Ekici
COMPUTERS & OPERATIONS RESEARCH (2021)
A new upper bound for the multiple knapsack problem
Paolo Detti
COMPUTERS & OPERATIONS RESEARCH (2021)
Memetic Search for Identifying Critical Nodes in Sparse Graphs
Yangming Zhou et al.
IEEE TRANSACTIONS ON CYBERNETICS (2019)
Solutions for the knapsack problem with conflict and forcing graphs of bounded clique-width
Frank Gurski et al.
MATHEMATICAL METHODS OF OPERATIONS RESEARCH (2019)
Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
Xiangjing Lai et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2019)
Iterated two-phase local search for the Set-Union Knapsack Problem
Zequn Wei et al.
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE (2019)
Optimization algorithms for the disjunctively constrained knapsack problem
Mariem Ben Salem et al.
SOFT COMPUTING (2018)
Exact approaches for the knapsack problem with setups
Fabio Furini et al.
COMPUTERS & OPERATIONS RESEARCH (2018)
Relaxations and heuristics for the multiple non-linear separable knapsack problem
Claudia D'Ambrosio et al.
COMPUTERS & OPERATIONS RESEARCH (2018)
A two-phase tabu-evolutionary algorithm for the 0-1 multidimensional knapsack problem
Xiangjing Lai et al.
INFORMATION SCIENCES (2018)
Cooperative parallel adaptive neighbourhood search for the disjunctively constrained knapsack problem
Zhe Quan et al.
ENGINEERING OPTIMIZATION (2017)
Approximation of knapsack problems with conflict and forcing graphs
Ulrich Pferschy et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2017)
PROBABILISTIC TABU SEARCH WITH MULTIPLE NEIGHBORHOODS FOR THE DISJUNCTIVELY CONSTRAINED KNAPSACK PROBLEM
Mariem Ben Salem et al.
RAIRO-OPERATIONS RESEARCH (2017)
A Branch-and-Bound Algorithm for the Knapsack Problem with Conflict Graph
Andrea Bettinelli et al.
INFORMS JOURNAL ON COMPUTING (2017)
An iterated hyperplane exploration approach for the quadratic knapsack problem
Yuning Chen et al.
COMPUTERS & OPERATIONS RESEARCH (2017)
Iterated responsive threshold search for the quadratic multiple knapsack problem
Yuning Chen et al.
ANNALS OF OPERATIONS RESEARCH (2015)
An iterative rounding search-based algorithm for the disjunctively constrained knapsack problem
Mhand Hifi
ENGINEERING OPTIMIZATION (2014)
A reduce and solve approach for the multiple-choice multidimensional knapsack problem
Yuning Chen et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2014)
Reduction strategies and exact algorithms for the disjunctively constrained knapsack problem
M. Hifi et al.
COMPUTERS & OPERATIONS RESEARCH (2007)
A reactive local search-based algorithm for the disjunctively constrained knapsack problem
M. Hifi et al.
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY (2006)
A threshold accepting metaheuristic for the heterogeneous fixed fleet vehicle routing problem
CD Tarantilis et al.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH (2004)
Upper bounds for the SPOT 5 daily photograph scheduling problem
M Vasquez et al.
JOURNAL OF COMBINATORIAL OPTIMIZATION (2003)
Benchmarking optimization software with performance profiles
ED Dolan et al.
MATHEMATICAL PROGRAMMING (2002)
A logic-constrained knapsack formulation and a tabu algorithm for the daily photograph scheduling of an earth observation satellite
M Vasquez et al.
COMPUTATIONAL OPTIMIZATION AND APPLICATIONS (2001)
分享论文
