Rational solutions of the graphsack problem (Q3315278): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximative Algorithms for Discrete Optimization Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4197626 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3939594 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 11:57, 14 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Rational solutions of the graphsack problem |
scientific article |
Statements
Rational solutions of the graphsack problem (English)
0 references
1984
0 references
constraints with tree structure
0 references
polynomially bounded algorithms
0 references
binary linear optimization
0 references
optimal network design
0 references
rational graphsack problems
0 references
compressed solutions
0 references
augmenting cuts
0 references
optimality criterion
0 references
efficient algorithm
0 references
