An Iterated Semi-Greedy Algorithm for the 0-1 Quadratic Knapsack Problem

EasyChair Preprints
doi 10.29007/fx82
Full Text
Abstract

Available in full text

Date
Authors
Publisher

EasyChair

Related search

Solving Robotic Distributed Flowshop Problem Using an Improved Iterated Greedy Algorithm

International Journal of Advanced Robotic Systems
2019English

An Exact Approach for the 0–1 Knapsack Problem With Setups

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2017English

Ant Colony System Algorithm With Dynamic Pheromone Updating for 0/1 Knapsack Problem

International Journal of Intelligent Systems and Applications
ControlSignal ProcessingHuman-Computer InteractionOptimizationComputer NetworksSimulationCommunicationsComputer Science ApplicationsModelingArtificial Intelligence
2019English

A Lagrangian Heuristic for the Multidimensional 0-1 Knapsack Problem

Journal of Korean Institute of Intelligent Systems
2010English

Memetic Search for the Generalized Quadratic Multiple Knapsack Problem

IEEE Transactions on Evolutionary Computation
Theoretical Computer ScienceComputational TheorySoftwareMathematics
2016English

An Iterated Local Search Algorithm for a Place Scheduling Problem

Mathematical Problems in Engineering
MathematicsEngineering
2013English

Tolerance Analysis for 0–1 Knapsack Problems

European Journal of Operational Research
Information SystemsSimulationManagement ScienceManagementComputer ScienceModelingOperations Research
2017English

Restarted Iterated Pareto Greedy Algorithm for Multi-Objective Flowshop Scheduling Problems

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2011English

Contrasting of Various Algorithmic Techniques to Solve Knapsack 0-1 Problem

JOIV : International Journal on Informatics Visualization
2020English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy