A multi-criteria approach to approximate solution of multiple-choice knapsack problem
From MaRDI portal
Publication:721960
DOI10.1007/s10589-018-9988-zzbMath1407.90268arXiv1712.06723OpenAlexW2964091621MaRDI QIDQ721960
Janusz Miroforidis, Ewa M. Bednarczuk, Przemysław Pyzel
Publication date: 20 July 2018
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1712.06723
Multi-objective and goal programming (90C29) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (3)
Knapsack problems -- an overview of recent advances. I: Single knapsack problems ⋮ Solutions and characterizations under multicriteria management systems ⋮ Choosing the capacity of arcs with constraint on flow delay time
Uses Software
Cites Work
- Unnamed Item
- A ``reduce and solve approach for the multiple-choice multidimensional knapsack problem
- Hard multidimensional multiple choice knapsack problems, an empirical study
- A branch and bound algorithm for solving the multiple-choice knapsack problem
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- A fast algorithm for the linear multiple-choice knapsack problem
- Constrained optimization using multiple objective programming
- A column generation method for the multiple-choice multi-dimensional knapsack problem
- Exact methods for the knapsack problem and its generalizations
- The 0-1 knapsack problem with multiple choice constraints
- Nonlinear multiobjective optimization
- A minimal algorithm for the multiple-choice knapsack problem
- Avoiding anomalies in the \(MT2\) algorithm by Martello and Toth
- New trends in exact algorithms for the \(0-1\) knapsack problem
- An iterative pseudo-gap enumeration approach for the multidimensional multiple-choice knapsack problem
- A hybrid dynamic programming/branch-and-bound algorithm for the multiple- choice knapsack problem
- A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- An O(n) algorithm for the multiple-choice knapsack linear program
- The Multiple-Choice Knapsack Problem
- Heuristic algorithms for the multiple-choice multidimensional knapsack problem
- Multicriteria Optimization
- Budgeting with bounded multiple-choice constraints.
This page was built for publication: A multi-criteria approach to approximate solution of multiple-choice knapsack problem
