A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (Q319637)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes |
scientific article; zbMATH DE number 6633612
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes |
scientific article; zbMATH DE number 6633612 |
Statements
A branch-price-and-cut method for the vegetable crop rotation scheduling problem with minimal plot sizes (English)
0 references
6 October 2016
0 references
OR in agriculture
0 references
crop rotation scheduling
0 references
branch-price-and-cut
0 references
strong branching
0 references
subadditive valid inequalities
0 references
0 references
0 references
0 references
0 references
0.8443109393119812
0 references
0.841848611831665
0 references
0.8225237727165222
0 references
0.8222765326499939
0 references
