Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (Q1804882): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Some polyhedra related to combinatorial problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: When the Greedy Solution Solves a Class of Knapsack Problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The cutting stock problem and integer rounding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Lot-Sizing with Constant Batches: Formulation and Valid Inequalities / rank | |||
Normal rank | |||
Revision as of 13:30, 23 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation |
scientific article |
Statements
Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (English)
0 references
1995
0 references
network design
0 references
knapsack
0 references
convex hulls
0 references
separation
0 references
