Carathéodory bounds for integer cones (Q2480055): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: A counterexample to an integer analogue of Carathéodory's theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An integer analogue of Carathéodory's theorem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The vertices of the knapsack polytope / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An instance of the cutting stock problem for which the rounding property does not hold / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Polynomial Algorithm for Multiprocessor Scheduling with Two Job Lengths / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3818127 / rank | |||
Normal rank |
Revision as of 19:29, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Carathéodory bounds for integer cones |
scientific article |
Statements
Carathéodory bounds for integer cones (English)
0 references
28 March 2008
0 references
Carathéodory's theorem
0 references
integer cone
0 references
integer programming
0 references
cutting stock
0 references
bin packing
0 references