A o(n logn) algorithm for LP knapsacks with GUB constraints (Q3854926): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An integer programming approach to a class of combinatorial problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Resolution of the 0–1 knapsack problem: Comparison of methods / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Convexity cuts for multiple choice problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Surrogate Constraint Duality in Mathematical Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A Branch Search Algorithm for the Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Surrogate Mathematical Programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The 0-1 knapsack problem with multiple choice constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Multiple-Choice Knapsack Problem / rank | |||
Normal rank | |||
Latest revision as of 02:44, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A o(n logn) algorithm for LP knapsacks with GUB constraints |
scientific article |
Statements
A o(n logn) algorithm for LP knapsacks with GUB constraints (English)
0 references
1979
0 references
integer programming
0 references
multiple choice
0 references
surrogate constraints
0 references
linear programming knapsack problem
0 references
generalized upper bound
0 references
dual simplex method
0 references
convex screening of variables
0 references
polynomial time algorithm
0 references
computational complexity
0 references
