The 1-Neighbour Knapsack Problem

DOI10.1007/978-3-642-25011-8_6MaRDI QIDQ3111641zbMATH OpenOpenAlexFDO

Authors Glencora Borradaile, Brent Heeringa, Gordon Wilfong

Publication date 13 January 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-25011-8_6

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Analysis of algorithms (68W40) Combinatorial optimization (90C27)

Recommendations

• The knapsack problem with neighbour constraints
• The knapsack problem with special neighbor constraints
• scientific article; zbMATH DE number 4005976
• The one dimensional Compartmentalised Knapsack problem: a case study
• Adjacency of the 0-1 knapsack problem
• 0-1 knapsack problems
• The 0-1 knapsack problem with a single continuous variable
• The knapsack problem with a minimum filling constraint

Cited in

(5)

• The knapsack problem with neighbour constraints
• The knapsack problem with special neighbor constraints
• The One-Terminal TELPAK Problem
• Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items
• The knapsack problem with special neighbor constraints on directed co-graphs

This page was built for publication: The 1-Neighbour Knapsack Problem

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