GitHub

TfELM : Extreme Learning Machines Framework with Python and TensorFlow

This framework provides a comprehensive set of tools and utilities for implementing and experimenting with Extreme Learning Machines using Python and TensorFlow. ELMs are a type of machine learning ...
IEEE

Chance-Constrained Multiple-Choice Knapsack Problem: Model, Algorithms, and Applications

Abstract: The multiple-choice knapsack problem (MCKP) is a classic NP-hard combinatorial optimization problem. Motivated by several significant real-world applications, this work investigates a novel ...
GitHub

vehicle-routing-problem

The open source Solver AI for Java and Kotlin to optimize scheduling and routing. Solve the vehicle routing problem, employee rostering, task assignment, maintenance scheduling and other planning ...
IEEE

QUBO Formulations and Characterization of Penalty Parameters for the Multi-Knapsack Problem

Abstract: The Multi-Knapsack Problem (MKP) is a fundamental challenge in operations research and combinatorial optimization. Quantum computing introduces new possibilities for solving MKP using ...