1998•Operations research, computer science. Interface seriesRequires access

Using Surrogate Constraints in Genetic Algorithms for Solving Multidimensional Knapsack Problems

Christian Haul, Stefan Voß

Open publisher page 16 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

OpenAlex reports 16 citations for this work. Citation counts describe recorded attention and do not establish research quality.

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, Heuristics, Mathematical optimization, Constraint (computer-aided design), Greedy algorithm, Genetic algorithm, Change-making problem

Back to paper search Browse research topics Original source

Using Surrogate Constraints in Genetic Algorithms for Solving Multidimensional Knapsack Problems — Research Paper | ScholarLens