Algorithms for some hard knapsack problems

QR Code

Algorithms for some hard knapsack problems

The Knapsack Problems are among the simplest integer programs which are NP-hard. Problems in this class are typically concerned with selecting from a set of given items, each with a specified weight and value, a subset of items whose weight sum does not exceed a prescribed capacity and whose value i...

Full description

Bibliographic Details
Main Author:	Kulanoot, Araya
Format:	Thesis
Language:	English
Published:	Curtin University 2000
Subjects:	Knapsack problems
Online Access:	http://hdl.handle.net/20.500.11937/1101

Similar Items

Suatu algoritma untuk penyelesaian masalah knapsack
by: Leow, Soo Kar
Published: (1988)

A study of evolutionary multiobjective algorithms and their application to knapsack and nurse scheduling problems
by: Le, Khoi Nguyen
Published: (2011)

A genetic programming hyper-heuristic for the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2014)

Modified choice function heuristic selection for the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2014)

A case study of controlling crossover in a selection hyper-heuristic framework using the multidimensional knapsack problem
by: Drake, John H., et al.
Published: (2015)

A Knapsack Problem Approach For Achieving Efficient Energy Consumption in Smart Grid for Endusers’ Life Style
by: Sianaki, Omid, et al.
Published: (2010)

Cheating for problem solving: a genetic algorithm with social interactions
by: Lahoz-Beltra, Rafael, et al.
Published: (2009)

Analysis of objectives relationships in multiobjective problems using trade-off region maps
by: Pinheiro, Rodrigo L., et al.
Published: (2015)

Hyper-volume evolutionary algorithm
by: Le, Khoi Nguyen, et al.
Published: (2016)

Crossover control in selection hyper-heuristics: case studies using MKP and HyFlex
by: Drake, John H.
Published: (2014)

Binary artificial algae algorithm for multidimensional knapsack problems
by: Zhang, X., et al.
Published: (2016)

Continuously controlled options: derivatives with added flexibility
by: Dokuchaev, Nikolai
Published: (2013)

Solving 0/1 Knapsack Problem Using Hybrid HS and Jaya Algorithms
by: Alomoush, Alaa A., et al.
Published: (2018)

A Binary differential search algorithm for the 0-1 multidimensional knapsack problem
by: Liu, J., et al.
Published: (2014)

A fuzzy genetic algorithm based on binary encoding for solving multidimensional knapsack problems
by: Varnamkhasti, Mohammad Jalali, et al.
Published: (2012)

Solving 0/1 Knapsack Problem using Opposition-based Whale Optimization Algorithm (OWOA)
by: Alamri, Hammoudeh S., et al.
Published: (2019)

Optimal solution to the fractional knapsack problem for LTE overload-state scheduling
by: Ferdosian, Nasim, et al.
Published: (2016)

Heuristic algorithms for routing problems.
by: Chong, Yen N.
Published: (2001)

Computational studies of some fuzzy mathematical problems
by: Remias, Michael George
Published: (2012)

A genetic algorithm for the cryptanalysis of Chor-Rivest knapsack public key cryptosystem (PKC)
by: Taha, Imad, et al.
Published: (1999)

“Between a rock and a hard place”: the “wicked problem” of coproducing chronic oedema care
by: Dring, Eleanore
Published: (2022)

Iterated heuristic algorithms for the classroom assignment problem
by: Constantino, Ademir Aparecido, et al.
Published: (2010)

Asymptotic Solutions and Numerical Methods for some Free-boundary Problems in Fluid Mechanics
by: Fan, Yiyun
Published: (2023)

Design and development of an automated mechanical valve for variable rate knapsack sprayer
by: Shamsi, Siti Mariam
Published: (2017)

Improvement of the ergonomical structure of Knapsack sprayer to propel cart sprayer (PCS)
by: Nordin, Norbaizura, et al.
Published: (2020)

Agent-based extraction algorithm for computational problem solving
by: Rajabi, Maryam
Published: (2015)

Application of Quality Function Deployment (QFD) to a Lever Operated Knapsack (LOK) Sprayer
by: Awang, Mohamad
Published: (2000)

Investigating the experiences of deaf or hard of hearing children participating in sport
by: Somerset, Sarah
Published: (2020)

Improvement of the total mass and operating time of Knapsack sprayer to Propel Cart Sprayer (PCS)
by: Nordin, Norbaizura, et al.
Published: (2020)

An iterated local search algorithm for the team orienteering problem with variable profits
by: Gunawan, Aldy, et al.
Published: (2018)

Extremal problems and designs on finite sets.
by: Roberts, Ian T.
Published: (1999)

One-step block methods for direct solving of linear boundary value Dirichlet and Neumann type problems
by: Hasni, Mohd Mughti
Published: (2014)

Global algorithms for nonlinear discrete optimization and discrete-valued optimal control problems
by: Woon, Siew Fang
Published: (2009)

Wavelet methods for solving linear and nonlinear singular boundary value problems
by: Nasab, Aliasghar Kazemi
Published: (2014)

Multi-stage hyper-heuristics for optimisation problems
by: Kheiri, Ahmed
Published: (2014)

Lookahead policy and genetic algorithm for solving nurse rostering problems
by: Shi, Peng, et al.
Published: (2018)

Optimal rearrangement problem and normalized obstacle problem in the fractional setting
by: Bonder, Julián Fernández, et al.
Published: (2020)

Rethinking the lecture: The application of problem based learning methods to atypical contexts
by: Rogal, S., et al.
Published: (2008)

Principles and applications of algorithmic problem solving
by: Ferreira, Joao Fernando Peixoto
Published: (2011)

Computational methods for solving optimal industrial process control problems
by: Chai, Qinqin
Published: (2013)