Determining the \(K\)-best solutions of knapsack problems
From MaRDI portal
Publication:342015
DOI10.1016/j.cor.2014.03.008zbMath1349.90716OpenAlexW2066502861MaRDI QIDQ342015
Aline A. S. Leão, Luiz H. Cherri, Marcos Nereu Arenales
Publication date: 17 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2014.03.008
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
A combinatorial auction mechanism for time-varying multidimensional resource allocation and pricing in fog computing ⋮ Finding multiplies solutions for non-linear integer programming
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The constrained compartmentalized knapsack problem: mathematical models and solution methods
- Tight bounds for periodicity theorems on the unbounded knapsack problem
- A new lower bound for the linear knapsack problem with general integer variables
- New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems
- A new enumeration scheme for the knapsack problem
- A set partitioning heuristic for the generalized assignment problem
- Solving binary cutting stock problems by column generation and branch- and-bound
- Unbounded knapsack problem: Dynamic programming revisited
- New developments in the primal-dual column generation technique
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- An improved typology of cutting and packing problems
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
- A Linear Programming Approach to the Cutting-Stock Problem
- A Branch-and-Price Algorithm for the Generalized Assignment Problem
- A Minimal Algorithm for the Bounded Knapsack Problem
- An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- The Theory and Computation of Knapsack Functions
- Algorithmic Applications in Management
This page was built for publication: Determining the \(K\)-best solutions of knapsack problems
