When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners

DOI10.1080/0305215x.2021.1933965zbMath1523.90291OpenAlexW3175602911WikidataQ111899390 ScholiaQ111899390MaRDI QIDQ6094505

Francis J. Vasko, Yun Lu, Brooks Emerick, Myung Soon Song

Publication date: 10 October 2023

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2021.1933965

zbMATH Keywords

combinatorial optimizationregression modelsmachine learningclassification treesinteger programming software

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items (1)

Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners

Cites Work

• Unnamed Item
• Alternating control tree search for knapsack/covering problems
• A genetic algorithm for the multidimensional knapsack problem
• Discrete facility location and routing of obnoxious activities.
• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
• Adaptive memory search for multidemand multidimensional knapsack problems
• Balancing and optimizing a portfolio of R&D projects
• A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
• An Introduction to Statistical Learning
• A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^®

This page was built for publication: When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners