Learning primal heuristics for 0-1 knapsack interdiction problems

DOI10.1007/978-3-031-95973-8_14MaRDI QIDQ6899323zbMATH OpenFDO

Authors Luca Ferrarini, Stefano Gualandi, Letizia Moro, Axel Parmentier

Publication date 14 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-95973-8_14

zbMATH Keywords

combinatorial optimizationFenchel-Young lossknapsack problemmachine learning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Cites work

• A class of algorithms for mixed-integer bilevel min-max optimization
• A dynamic programming algorithm for the bilevel Knapsack problem
• A dynamic reformulation heuristic for generalized interdiction problems
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A new class of hard problem instances for the 0-1 knapsack problem
• A new general-purpose algorithm for mixed-integer bilevel linear programs
• A study on the computational complexity of the bilevel knapsack problem
• A survey on mixed-integer programming techniques in bilevel optimization
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions
• Bilevel knapsack with interdiction constraints
• Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem
• Deep learning based high accuracy heuristic approach for knapsack interdiction problem
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 7255066 (Why is no real title available?)
• Interdiction Games and Monotonicity, with Application to Knapsack Problems
• Multilevel approaches for the critical node problem
• On the partition of numbers.
• The Mixed Integer Linear Bilevel Programming Problem
• The theory of dynamic programming
• Where are the hard knapsack problems?

This page was built for publication: Learning primal heuristics for 0-1 knapsack interdiction problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899323)