Pages that link to "Item:Q4939603"

The following pages link to Linear Time Algorithms for Knapsack Problems with Bounded Weights (Q4939603):

Displaying 31 items.

• Selfish bin covering (Q650947) (← links)
• Solving sequential knapsack problems (Q688211) (← links)
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
• Modified subset sum heuristics for bin packing (Q1044695) (← links)
• An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
• Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
• New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
• A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
• Change-making problems revisited: a parameterized point of view (Q1679517) (← links)
• Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
• Where are the hard knapsack problems? (Q1772862) (← links)
• More on change-making and related problems (Q2051861) (← links)
• Actively secure setup for SPDZ (Q2072211) (← links)
• Target-based computer-assisted orchestration: complexity and approximation algorithms (Q2079398) (← links)
• Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
• Scheduling lower bounds via AND subset sum (Q2121467) (← links)
• Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
• An exact approach for the bilevel knapsack problem with interdiction constraints and extensions (Q2196299) (← links)
• A linear-time algorithm for solving continuous maximin knapsack problems (Q2277359) (← links)
• Three is easy, two is hard: Open shop sum-batch scheduling problem refined (Q2466597) (← links)
• Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)
• (Q5091168) (← links)
• A Decentralized Heuristic for Multiple-Choice Combinatorial Optimization Problems (Q5171816) (← links)
• On the Hardness of Energy Minimisation for Crystal Structure Prediction* (Q5862342) (← links)
• (Q5874497) (← links)
• Structural parameterizations of budgeted graph coloring (Q5925707) (← links)
• Learning-augmented algorithms for online subset sum (Q6064057) (← links)
• Algebraic algorithms for variants of subset sum (Q6102280) (← links)
• Features for the 0-1 knapsack problem based on inclusionwise maximal solutions (Q6168585) (← links)
• Approximating subset sum ratio via partition computations (Q6541032) (← links)
• Expectation analysis for bounding solutions of the 0-1 knapsack problem (Q6636466) (← links)