Robust efficiency measures for linear knapsack problem variants
From MaRDI portal
Publication:323349
DOI10.1016/j.ejor.2016.04.025zbMath1346.90723OpenAlexW2340214044MaRDI QIDQ323349
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
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Bicriteria food packaging process optimization in double-layered upright and diagonal multihead weighers ⋮ Optimal setup of a multihead weighing machine ⋮ Two-stage solution-based tabu search for the multidemand multidimensional knapsack problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Model and algorithms for multi-period sea cargo mix problem
- An exact algorithm for large unbounded knapsack problems
- Alternating control tree search for knapsack/covering problems
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- Solving the bi-objective multi-dimensional knapsack problem exploiting the concept of core
- Exact methods for the knapsack problem and its generalizations
- A genetic algorithm for the multidimensional knapsack problem
- A minimal algorithm for the multiple-choice knapsack problem
- An expanding-core algorithm for the exact \(0-1\) knapsack problem
- Discrete facility location and routing of obnoxious activities.
- New trends in exact algorithms for the \(0-1\) knapsack problem
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
- Core problems in bi-criteria \(\{0,1\}\)-knapsack problems
- Adaptive memory search for multidemand multidimensional knapsack problems
- Balancing and optimizing a portfolio of R&D projects
- Core Problems in Knapsack Algorithms
- The multiobjective multidimensional knapsack problem: a survey and a new approach
- A Local-Search-Based Heuristic for the Demand-Constrained Multidimensional Knapsack Problem
- The Multidimensional Knapsack Problem: Structure and Algorithms
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A survey of effective heuristics and their application to a variety of knapsack problems
- A New Algorithm for the 0-1 Knapsack Problem
- An Algorithm for Large Zero-One Knapsack Problems
- Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data
- A Minimal Algorithm for the 0-1 Knapsack Problem
- Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
- A Minimal Algorithm for the Bounded Knapsack Problem
- Discrete-Variable Extremum Problems
This page was built for publication: Robust efficiency measures for linear knapsack problem variants
