Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604): Difference between revisions

Latest revision as of 07:42, 3 August 2024

scientific article; zbMATH DE number 7755348

Language	Label	Description	Also known as
English	Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties	scientific article; zbMATH DE number 7755348

Statements

instance of

scholarly article

0 references

title

Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (English)

0 references

0 references

0 references

0 references

0 references

0 references

26 October 2023

0 references

zbMATH Keywords

combinatorial optimization

0 references

knapsack problem

0 references

divisible item sizes

0 references

penalties

0 references

combinatorial algorithms

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

An optimization algorithm for a penalized knapsack problem

0 references

Bin packing with divisible item sizes

0 references

New exact approaches and approximation results for the penalized knapsack problem

0 references

Online algorithms. The state of the art

0 references

Bin packing problems with rejection penalties and their dual problems

0 references

Bin packing with rejection revisited

0 references

AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items

0 references

Q4198056

0 references

Solving sequential knapsack problems

0 references

Computing Partitions with Applications to the Knapsack Problem

0 references

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

0 references

A faster FPTAS for the unbounded knapsack problem

0 references

Algorithms for the variable sized bin packing problem

0 references

A new fully polynomial time approximation scheme for the Knapsack problem

0 references

Q4821303

0 references

Q4057549

0 references

Combinatorial optimization. Theory and algorithms.

0 references

Bin packing with divisible item sizes and rejection penalties

0 references

New trends in exact algorithms for the \(0-1\) knapsack problem

0 references

Q3993418

0 references

An Efficient Algorithm for the 0-1 Knapsack Problem

0 references

Approximate Algorithms for the 0/1 Knapsack Problem

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

Q4782696

0 references

A polynomial-time algorithm for knapsack with divisible item sizes

0 references

The Design of Approximation Algorithms

0 references

Identifiers

DOI

10.1007/s11590-022-01969-4

0 references

Mathematics Subject Classification ID

90C27

0 references

zbMATH DE Number

7755348

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6081604

@@ Property / cites work @@
+An optimization algorithm for a penalized knapsack problem
+Normal rank
@@ Property / cites work @@
+Bin packing with divisible item sizes
@@ Property / cites work: Bin packing with divisible item sizes / rank @@
+Normal rank
@@ Property / cites work @@
+New exact approaches and approximation results for the penalized knapsack problem
+Normal rank
@@ Property / cites work @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / rank @@
+Normal rank
@@ Property / cites work @@
+Bin packing problems with rejection penalties and their dual problems
+Normal rank
@@ Property / cites work @@
+Bin packing with rejection revisited
@@ Property / cites work: Bin packing with rejection revisited / rank @@
+Normal rank
@@ Property / cites work @@
+AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Solving sequential knapsack problems
@@ Property / cites work: Solving sequential knapsack problems / rank @@
+Normal rank
@@ Property / cites work @@
+Computing Partitions with Applications to the Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
+Normal rank
@@ Property / cites work @@
+A faster FPTAS for the unbounded knapsack problem
@@ Property / cites work: A faster FPTAS for the unbounded knapsack problem / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms for the variable sized bin packing problem
+Normal rank
@@ Property / cites work @@
+A new fully polynomial time approximation scheme for the Knapsack problem
+Normal rank
@@ Property / cites work @@
+Q4821303
@@ Property / cites work: Q4821303 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4057549
@@ Property / cites work: Q4057549 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Theory and algorithms.
+Normal rank
@@ Property / cites work @@
+Bin packing with divisible item sizes and rejection penalties
+Normal rank
@@ Property / cites work @@
+New trends in exact algorithms for the \(0-1\) knapsack problem
+Normal rank
@@ Property / cites work @@
+Q3993418
@@ Property / cites work: Q3993418 / rank @@
+Normal rank
@@ Property / cites work @@
+An Efficient Algorithm for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Approximate Algorithms for the 0/1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ Property / cites work @@
+A polynomial-time algorithm for knapsack with divisible item sizes
+Normal rank
@@ Property / cites work @@
+The Design of Approximation Algorithms
@@ Property / cites work: The Design of Approximation Algorithms / rank @@
+Normal rank