2012•Advances in intelligent and soft computingRequires access

Comparison of Deterministic and Probabilistic Approaches for Solving 0/1 Knapsack Problem

Ritika Mahajan, Sarvesh Chopra, Sonika Jindal

Open publisher page 0 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Knapsack problem, Continuous knapsack problem, Mathematical optimization, Change-making problem, Heuristic, Cutting stock problem, Generalized assignment problem, Polynomial-time approximation scheme

Back to paper search Browse research topics Original source

Comparison of Deterministic and Probabilistic Approaches for Solving 0/1 Knapsack Problem — Research Paper | ScholarLens