ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2211.09665
  4. Cited By
Features for the 0-1 knapsack problem based on inclusionwise maximal
  solutions

Features for the 0-1 knapsack problem based on inclusionwise maximal solutions

16 November 2022
Jorik Jooken
Pieter Leyman
P. D. Causmaecker
ArXivPDFHTML

Papers citing "Features for the 0-1 knapsack problem based on inclusionwise maximal solutions"

4 / 4 papers shown
Title
Automated Algorithm Selection: Survey and Perspectives
Automated Algorithm Selection: Survey and Perspectives
P. Kerschke
Holger H. Hoos
Frank Neumann
Heike Trautmann
17
376
0
28 Nov 2018
Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D
Fast Exact k-Means, k-Medians and Bregman Divergence Clustering in 1D
A. Jørgensen
Kasper Green Larsen
Alexander Mathiasen
J. Nielsen
Stefan Schneider
Mingzhou Song
31
62
0
25 Jan 2017
XGBoost: A Scalable Tree Boosting System
XGBoost: A Scalable Tree Boosting System
Tianqi Chen
Carlos Guestrin
254
37,815
0
09 Mar 2016
Algorithm Runtime Prediction: Methods & Evaluation
Algorithm Runtime Prediction: Methods & Evaluation
Frank Hutter
Lin Xu
Holger H. Hoos
Kevin Leyton-Brown
52
418
0
05 Nov 2012
1