On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems (Q1265899): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 10:43, 31 January 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On tightening 0-1 programs based on extensions of pure 0-1 knapsack and subset-sum problems |
scientific article |
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