The min-Knapsack problem with compactness constraints and applications in statistics

DOI10.1016/j.ejor.2023.07.020OpenAlexW4384774819MaRDI QIDQ6069243

Enrico Malaguti, Alberto Santini

Publication date: 14 November 2023

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2023.07.020

zbMATH Keywords

dynamic programmingcuttingKnapsack problemsapplications in statistics

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Best subset selection via a modern optimization lens
• Thinning out Steiner trees: a node-based model for uniform edge costs
• Optimization problems for machine learning: a survey
• Decision space robustness for multi-objective integer linear programming
• Political districting: from classical models to recent approaches
• Connections in Networks: Hardness of Feasibility Versus Optimality
• Imposing Contiguity Constraints in Political Districting Models
• A Simple New Approach to Variable Selection in Regression, with Application to Genetic Fine Mapping

This page was built for publication: The min-Knapsack problem with compactness constraints and applications in statistics