An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
From MaRDI portal
Publication:5189094
DOI10.1590/S0101-74382000000100011zbMath1181.90235MaRDI QIDQ5189094
Nei Yoshihiro Soma, Nelson F. Maculan, Horacio Hideki Yanasse
Publication date: 6 March 2010
Published in: Pesquisa Operacional (Search for Journal in Brave)
Related Items (4)
A polynomial approximation scheme for the subset sum problem ⋮ The Kth TSP is pseudopolynomial when TSP is polynomial ⋮ Determining the \(K\)-best solutions of knapsack problems ⋮ The constrained compartmentalised knapsack problem
Cites Work
- Solving k-shortest and constrained shortest path problems efficiently
- A new enumeration scheme for the knapsack problem
- Dynamic programming algorithms for the zero-one knapsack problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Implementation of algorithms forK shortest loopless paths
- An efficient algorithm for K shortest simple paths
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
- A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
- Generalized dynamic programming methods in integer programming
This page was built for publication: An algorithm for determining the K-best solutions of the one-dimensional Knapsack problem
