On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems (Q1265899)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1202750
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems |
scientific article; zbMATH DE number 1202750 |
Statements
On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems (English)
0 references
8 November 1998
0 references
knapsack constraints
0 references
cliques
0 references
covers
0 references
variable covers
0 references
variable upper bounds
0 references
coefficient reduction and increasing
0 references
lifting
0 references
probing
0 references
automatic tightening of general 0-1 programs
0 references
0-1 knapsack
0 references
subset-sum problems
0 references
0.9619415402412416
0 references
0.8264392614364624
0 references
0.8035165667533875
0 references
0.8015521168708801
0 references
0.7937918901443481
0 references
