Tolerance Analysis for 0–1 Knapsack Problems

European Journal of Operational Research - Netherlands
doi 10.1016/j.ejor.2016.10.054
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

A Lagrangian Heuristic for the Multidimensional 0-1 Knapsack Problem

Journal of Korean Institute of Intelligent Systems
2010English

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

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2017English

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

EasyChair Preprints
2018English

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

Improved Approximation Results for Stochastic Knapsack Problems

2011English

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

JOIV : International Journal on Informatics Visualization
2020English

Knapsack Problems: A Parameterized Point of View

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2019English

Simple Lifted Cover Inequalities and Hard Knapsack Problems

Discrete Optimization
Computational TheoryApplied MathematicsTheoretical Computer ScienceMathematics
2005English

Degrees of Nonlinearity in Forbidden 0–1 Matrix Problems

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy