A new class of hard problem instances for the 0–1 knapsack problem-Reference-Cited by-同舟云学术

A new class of hard problem instances for the 0–1 knapsack problem

Published:2021-12 Issue: Volume: Page:
ISSN:0377-2217
Container-title:European Journal of Operational Research
language:en
Short-container-title:European Journal of Operational Research

Author:

Jooken Jorik^ORCID,Leyman Pieter^ORCID,De Causmaecker Patrick

Funder

Vlaamse Overheid

Fonds Wetenschappelijk Onderzoek Vlaanderen

Publisher

Elsevier BV

Subject

Information Systems and Management,Management Science and Operations Research,Modeling and Simulation,General Computer Science,Industrial and Manufacturing Engineering

Reference40 articles.

1. Rigorous location of phase transitions in hard optimization problems;Achlioptas;Nature,2005

2. The traveling salesman problem: A computational study;Applegate,2006

3. Certification of an optimal TSP tour through 85,900 cities;Applegate;Operations Research Letters,2009

4. An algorithm for large zero-one knapsack problems;Balas;Operations Research,1980

5. Dynamic programming;Bellman;Science,1966

Cited by 12 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Applying instance space analysis for metaheuristic selection to the 0–1 multidemand multidimensional knapsack problem;Computers & Operations Research;2024-10

2. Learning Descriptors for Novelty-Search Based Instance Generation via Meta-evolution;Proceedings of the Genetic and Evolutionary Computation Conference;2024-07-14

3. Instance-dependent misclassification cost-sensitive learning for default prediction;Research in International Business and Finance;2024-04

4. A practical approach for dealing with hard knapsack problems using general‐purpose integer programming software;International Transactions in Operational Research;2024-03

5. Instance space analysis for 2D bin packing mathematical models;European Journal of Operational Research;2023-12