An Algorithm for Determining the K-Best Solutions of the One-Dimensional Knapsack Problem

Pesquisa Operacional - Brazil
doi 10.1590/s0101-74382000000100011
Full Text
Abstract

Available in full text

Date
Authors
Publisher

FapUNIFESP (SciELO)

Related search

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

EasyChair Preprints
2018English

Heuristic Solutions for the Multiple-Choice Multi-Dimension Knapsack Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2001English

A Novel Evolutionary Algorithm for Multidimensional Knapsack Problem

International Journal of Operations Research and Information Systems
2015English

Proposal of Adjustment Type Genetic Algorithm for Knapsack Problem

IEEJ Transactions on Electronics, Information and Systems
Electronic EngineeringElectrical
2004English

An Exact Parallel Algorithm for the Radio K-Coloring Problem

2019English

A New Genetic Algorithm for Multiple-Choice Multidimensional Knapsack Problem

The International Conference on Electrical Engineering
2010English

Improved Discrete Differential Evolution Algorithm in Solving Quadratic Assignment Problem for Best Solutions

International Journal of Advanced Computer Science and Applications
Computer Science
2018English

Distance Based K-Means Clustering Algorithm for Determining Number of Clusters for High Dimensional Data

Decision Science Letters
Decision Sciences
2020English

On the Robust Knapsack Problem

SIAM Journal on Optimization
Theoretical Computer ScienceSoftware
2013English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy