American Journal of Operations Research

American Journal of Operations Research

ISSN Print: 2160-8830
ISSN Online: 2160-8849
www.scirp.org/journal/ajor
E-mail: ajor@scirp.org
"The 0/1 Multidimensional Knapsack Problem and Its Variants: A Survey of Practical Models and Heuristic Approaches"
written by Soukaina Laabadi, Mohamed Naimi, Hassan El Amri, Boujemâa Achchab,
published by American Journal of Operations Research, Vol.8 No.5, 2018
has been cited by the following article(s):
  • Google Scholar
  • CrossRef
[1] Quantum Computing Techniques for Multi-Knapsack Problems
arXiv preprint arXiv …, 2023
[2] The knapsack problem and its variants: formulations and solution methods
The Palgrave Handbook of …, 2022
[3] Incentivisation of Outsourced Network Testing: View from Platform Perspective.
ICISSP, 2022
[4] User Centered Security Service Level Agreement Enforcement Mechanisms
2022
[5] TLBO-based Algorithms for Minimalization of Multi-Ray Path Lengths in Voxel Object Representations on the GPU
2022
[6] Knapsack problems-An overview of recent advances. Part II: Multiple, multidimensional, and quadratic knapsack problems
Computers & Operations …, 2022
[7] Intelligent system for recruitment decision making using an alternative parallel-sequential genetic algorithm
Indones. J. Electr …, 2022
[8] Variable neighborhood search for the discounted {0-1} knapsack problem
Applied Soft Computing, 2022
[9] Towards Reinterpreting Neural Topic Models via Composite Activations
Proceedings of the 2022 Conference on …, 2022
[10] A simple and efficient technique to generate bounded solutions for the multidimensional Knapsack problem: A guide for OR practitioners
Ertas… - International Journal of …, 2021
[11] When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners
2021
[12] Scheduling problems in rail transshipment yards and industrial production
2021
[13] Optimization Method to Address Psychosocial Risks through Adaptation of the Multidimensional Knapsack Problem
2021
[14] A Novel Core-Based Optimization Framework for Binary Integer Programs-the Multidemand Multidimesional Knapsack Problem as a Test Problem
2021
[15] Optimization Method to Address Psychosocial Risks through Adaptation of the Multidimensional Knapsack Prob-lem. Mathematics 2021, 9, 1126
2021
[16] Heating Homes with Servers: Workload Scheduling for Heat Reuse in Distributed Data Centers
2021
[17] Particle Swarm Optimization-Based Resource Allocation in Service Composition
2021
[18] Adaptive binary artificial bee colony for multi-dimensional knapsack problem
J. Gazi Univ. Fac. Eng. Archit, 2021
[19] Çok boyutlu sırt çantası problemi için adaptif ikili yapay arı kolonisi algoritması (AİYAK)
Gazi Üniversitesi Mühendislik Mimarlık …, 2021
[20] On a New Constraint Reduction Heuristic Using Improved Bisection Method for Mixed Integer Linear Programming
2020
[21] An OR practitioner's solution approach to the multidimensional knapsack problem
2020
[22] Solving Billion-Scale Knapsack Problems
2020
[23] Bitrate Adaptation for Video Streaming Services in Edge Caching Systems
2020
[24] An Iterated Dual Substitution Approach for Binary Integer Programming Problems under the Min-Max Regret Criterion
2020
[25] Simple population-based metaheuristics for the multiple demand multiple-choice multidimensional knapsack problem
2020
[26] New approaches to improving live video delivery over content delivery networks
2020
[27] Effective Methods for Constraint Handling in Quantum Inspired Evolutionary Algorithm for Multi-Dimensional 0–1 Knapsack Problem
2019
[28] QoS Based Optimal Resource Allocation in Service Composition for Heterogeneous Devices
2019
[29] An improved sexual genetic algorithm for solving 0/1 multidimensional knapsack problem
2019
[30] A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming …
2019
[31] Product sequencing in multiple-piece-flow assembly lines
2019
[32] On Solving 0/1 Multidimensional Knapsack Problem with a Genetic Algorithm Using a Selection Operator Based on K-Means Clustering Principle
[33] A genetic algorithm based on k-means method for solving 0/1 multidimensionnal knapsack problem
S Laabadi, M Naimi, H El Amri
Free SCIRP Newsletters
Copyright © 2006-2024 Scientific Research Publishing Inc. All Rights Reserved.
Top