An algorithm for determining the k-best solutions of the one-dimensional knapsack problem

DOI10.1590/S0101-74382000000100011zbMATH Open1181.90235MaRDI QIDQ5189094FDOQ5189094

Authors: Nei Yoshihiro Soma, Horacio Hideki Yanasse, Nelson Maculan 

Publication date: 6 March 2010

Published in: Pesquisa Operacional (Search for Journal in Brave)

Recommendations

• Algorithmic Applications in Management
• Determining the \(K\)-best solutions of knapsack problems
• A new enumeration scheme for the knapsack problem
• scientific article; zbMATH DE number 4023019
• scientific article; zbMATH DE number 3852791

zbMATH Keywords

knapsack problem\(k\)-best solutions

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• A new enumeration scheme for the knapsack problem
• Dynamic programming algorithms for the zero-one knapsack problem
• An efficient algorithm for K shortest simple paths
• Implementation of algorithms forK shortest loopless paths
• Solving k-shortest and constrained shortest path problems efficiently
• Generalized dynamic programming methods in integer programming

Cited In (6)

• The \(K\)th TSP is pseudopolynomial when TSP is polynomial
• The constrained compartmentalised knapsack problem
• Determining the \(K\)-best solutions of knapsack problems
• Algorithmic Applications in Management
• A polynomial approximation scheme for the subset sum problem
• A new enumeration scheme for the knapsack problem

This page was built for publication: An algorithm for determining the \(k\)-best solutions of the one-dimensional knapsack problem

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