knapsack
There are 192 repositories under knapsack topic.
rubensolozabal/BinPacking_Neural_Combinatorial_Optimization
Bin Packing Problem using Neural Combinatorial Optimization.
TrainingByPackt/CPP-Data-Structures-and-Algorithm-Design-Principles
Leverage the power of modern C++ to build robust and scalable applications
je-suis-tm/recursion-and-dynamic-programming
Julia and Python recursion algorithm, fractal geometry and dynamic programming applications including Edit Distance, Knapsack (Multiple Choice), Stock Trading, Pythagorean Tree, Koch Snowflake, Jerusalem Cross, Sierpiński Carpet, Hilbert Curve, Pascal Triangle, Prime Factorization, Palindrome, Egg Drop, Coin Change, Hanoi Tower, Cantor Set, Fibonacci
albert-espin/knapsack-packing
Evolutionary Algorithm for the 2D Packing Problem combined with the 0/1 Knapsack Problem (Master Thesis)
renderedtext/test-boosters
Auto Parallelization - runs test files in multiple jobs
jmyrberg/mknapsack
Algorithms for solving knapsack problems with Python
rafaelmartinelli/Knapsacks.jl
Julia package to solve Knapsack problems
LucasBoTang/Coursera_Discrete_Optimization
Exact and meta-heuristic algorithms for NP problems
buildkite/rails-docker-parallel-example
An example pipeline that runs parallel tests for a Rails app using Docker and Knapsack.
devfacet/knapsack
A module for resource allocation solving
DevSlem/multiple-knapsack
Optimize multiple knapsack problem using reinforcement learning.
afurculita/multifactorial-evolution
Evolutionary Multitasking in Permutation-Based Combinatorial Optimization Problems: Realization with TSP and Knapsack
ChaseDurand/Array-Subsets
Solution implementation for HackerRank's Array-Subsets problem.
neemiasbsilva/knapsack-problem-using-dp-grasp-tabu
This repository was created for the subject of Computer Theory. The propose of this subject is to improve your skills to solve the 0-1 knapsack problem of different ways. The techniques used were Dynamic Programing and two metaheuristics (which are GRASP and TABU search).
TashinParvez/Data_Structure_and_Algorithms_2_UIU
All DSA-2 topics are covered in the UIU DSA-2 course, including both lab and theory courses. Check DSA-1 Topics: https://github.com/TashinParvez/DSA_1_UIU
zvadaadam/knapsack
Knapsack algorithms
hzxie/Algorithms
Classical algorithm implementation.
buildkite/rails-parallel-example
An example pipeline that runs Rails tests in parallel across multiple agents using Knapsack.
joaonmatos/hash-code-2020
My team's Hash Code 2020 solutions
KaleabTessera/KnapSackProblem
Knapsack Problem implemented in Python. This includes a Linear Greedy and Quadratic Knapsack Implementation.
KhaledAshrafH/GA-Knapsackizer
This repository contains a C++ program that solves the Knapsack Problem using a Genetic Algorithm. The Knapsack Problem is a classic optimization problem where we aim to maximize the total value of items to be packed in a knapsack, given the knapsack's weight capacity and a set of items with their respective weights and values.
arpitbbhayani/genetic-knapsack
Genetic Algorithm for Knapsack Problem
imdeep2905/Coding-Challenge-Team-Vanished-Gradient
Heuristic solution for Knapsack Container Loading Problem (KCLP) implemented in C++ with visualization in python.
kowshik-sundararajan/CS3230
Design and Analysis of Algorithms (CS3230) - National University of Singapore
aritrasep/Modolib.jl
Multi-Objective Discrete Optimization Instance Library
DamascenoRafael/mcmc-knapsack-problem
Python development to solve the 0/1 Knapsack Problem using Markov Chain Monte Carlo techniques, dynamic programming and greedy algorithm.
DeepthiTabithaBennet/DesignAndAnalysisOfAlgorithms
A collection of simple C++ Programs involving the Design and Analysis of Algorithms.
SleekPanther/knapsack-problem
Implementation of the 0-1 Knapsack Problem
lirfu/ECF-GeneticAlgorithmInspiredByQuantumMechanics
Quantum genetic algorithm as an extension of the framework ECF.
NiklasLundstrom/Knapsack
Solving the knapsack problem using Ant Colony Optimisation (ACO)
OPTANO/optano.modeling.examples
Examples for OPTANO.Modeling
Pegah-Ardehkhani/Combinatorial-Optimization
A collection of algorithms and methods for solving combinatorial optimization problems, including techniques for TSP, Knapsack, and other NP-hard problems using heuristics, metaheuristics, and exact methods
VidhyaVarshanyJS/EnsembleX
EnsembleX utilizes the Knapsack algorithm to optimize Large Language Model (LLM) ensembles for quality-cost trade-offs, offering tailored suggestions across various domains through a Streamlit dashboard visualization.
alejomonbar/LR-QAOA
Fixed linear ramp schedules in QAOA constitute a universal set parameters, i.e., a set of γ and β parameters that rapidly approximate the optimal solution, x∗, independently of the COP selected, and that the success probability of finding it, probability(x∗), increases with the number of QAOA layers p.
chutrunganh/Optimization-Project-IT3052E
Optimizing the bin packing problem, aiming to efficiently allocate items of varying sizes into a finite number of bins while maximizing total profit, using optimization algorithms
RaedAddala/OR-Solver
This is an Operations Research Course Project. This is a QT GUI that implements Knapsack and Transportation Cost Problem. We used Gurobi as A Solver.