Robust efficiency measures for linear knapsack problem variants

DOI10.1016/J.EJOR.2016.04.025MaRDI QIDQ323349zbMATH OpenOpenAlexFDO

Authors Christopher Wishon, J. Rene Villalobos

Publication date 7 October 2016

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

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

zbMATH Keywords

combinatorial optimizationheuristicgenetic algorithmknapsack problem

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Recommendations

• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• The multidimensional knapsack problem: structure and algorithms
• The core concept for the Multidimensional Knapsack problem
• Fast, effective heuristics for the 0-1 multi-dimensional knapsack problem
• When to use Integer Programming Software to solve large multi-demand multidimensional knapsack problems: a guide for operations research practitioners

Cites work

• scientific article; zbMATH DE number 2130001 (Why is no real title available?)
• scientific article; zbMATH DE number 5282967 (Why is no real title available?)
• scientific article; zbMATH DE number 6180864 (Why is no real title available?)
• A Minimal Algorithm for the 0-1 Knapsack Problem
• A Minimal Algorithm for the Bounded Knapsack Problem
• A New Algorithm for the 0-1 Knapsack Problem
• A genetic algorithm for the multidimensional knapsack problem
• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• A minimal algorithm for the multiple-choice knapsack problem
• A survey of effective heuristics and their application to a variety of knapsack problems
• Adaptive memory search for multidemand multidimensional knapsack problems
• Alternating control tree search for knapsack/covering problems
• An Algorithm for Large Zero-One Knapsack Problems
• An exact algorithm for large unbounded knapsack problems
• An expanding-core algorithm for the exact 0-1 knapsack problem
• Balancing and optimizing a portfolio of R&D projects
• Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
• Core problems in knapsack algorithms
• Discrete facility location and routing of obnoxious activities.
• Discrete-variable extremum problems
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Exact methods for the knapsack problem and its generalizations
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• Kernel search: a general heuristic for the multi-dimensional knapsack problem
• Model and algorithms for multi-period sea cargo mix problem
• New trends in exact algorithms for the \(0-1\) knapsack problem
• Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
• The multidimensional knapsack problem: structure and algorithms
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
• Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data

Cited in

(4)

• Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
• Optimal setup of a multihead weighing machine
• Complexity results and exact algorithms for robust knapsack problems
• Bicriteria food packaging process optimization in double-layered upright and diagonal multihead weighers

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Robust efficiency measures for linear knapsack problem variants

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