Reoptimizing the 0-1 knapsack problem (Q608266)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Reoptimizing the 0-1 knapsack problem	scientific article

Statements

scholarly article

0 references

Reoptimizing the 0-1 knapsack problem (English)

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

25 November 2010

0 references

zbMATH Keywords

worst-case analysis

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2010.08.003

0 references

Reoptimizing the traveling salesman problem

0 references

Reoptimization of Minimum and Maximum Traveling Salesman’s Tours

0 references

On the Hardness of Reoptimization

0 references

Approximation algorithms for knapsack problems with cardinality constraints

0 references

0 references

Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

0 references

A new fully polynomial time approximation scheme for the Knapsack problem

0 references

Improved dynamic programming in connection with an FPTAS for the knapsack problem

0 references

0 references

Fast Approximation Algorithms for Knapsack Problems

0 references

0 references

Approximate Algorithms for the 0/1 Knapsack Problem

0 references

Scheduling with forbidden sets

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.dam.2010.08.003

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:608266

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q608266&oldid=35202192"