A solution method for a knapsack problem and its variant

DOI10.1007/BF03167093zbMath0625.90059OpenAlexW2087836010MaRDI QIDQ3028724

Yoshio Hayashi

Publication date: 1986

Published in: Japan Journal of Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf03167093

zbMATH Keywords

knapsack problemDijkstra's shortest path algorithmsingle equality constraint

Mathematics Subject Classification ID

Integer programming (90C10) Linear Diophantine equations (11D04) Algorithms in computer science (68W99)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on two problems in connexion with graphs
• Some polyhedra related to combinatorial problems
• A Minimal-Path Algorithm for the "Money Changing Problem"
• Minimal Inequalities and Subadditive Duality
• Hard Knapsack Problems
• On the existence of optimal solutions to integer and mixed-integer programming problems
• When the Greedy Solution Solves a Class of Knapsack Problems
• Technical Note—Solving Integer Programming Problems by Aggregating Constraints
• ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
• Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
• Group Theoretic Algorithms for the Integer Programming Problem II: Extension to a General Algorithm
• The Theory and Computation of Knapsack Functions
• An Adaptive Group Theoretic Algorithm for Integer Programming Problems
• Computational experience with a group theoretic integer programming algorithm

This page was built for publication: A solution method for a knapsack problem and its variant