Simple lifted cover inequalities and hard knapsack problems (Q2581317): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Hard Knapsack Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4737524 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lifted Cover Inequalities for 0-1 Integer Programs: Complexity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Trivial integer programs unsolvable by branch-and-bound / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The complexity of cover inequality separation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convergence of stochastic processes / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4254875 / rank | |||
Normal rank |
Latest revision as of 14:50, 11 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Simple lifted cover inequalities and hard knapsack problems |
scientific article |
Statements
Simple lifted cover inequalities and hard knapsack problems (English)
0 references
9 January 2006
0 references
integer programming
0 references
branch and bound
0 references
average case
0 references
cover inequality
0 references
knapsack
0 references
lifting
0 references