1997•Victoria University Research Repository (Victoria University)Open access

A complementary heuristic for the unbounded knapsack problem

Swarna Chitra Iyer

Abstract

A complementary heuristic for the unbounded knapsack problem Declaration I hereby certify that: 1. the following thesis contains only m y original work, 2. due acknowledgment has been made in the text of the thesis to all other material used and 3. the thesis is less than 60,000 words in length, exclusive of tables, figures and footnotes.

Open-access reader

About this research paper

What this paper is about

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.

Available abstract

Key concepts: Greedy algorithm, Greedy randomized adaptive search procedure, Heuristic, Knapsack problem, Heuristics, Mathematical optimization, Mathematics, Null-move heuristic