Improving branch-and-cut performance by random sampling (Q266414): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C10 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90C11 / rank | |||
Normal rank | |||
| Property / Mathematics Subject Classification ID | |||
| Property / Mathematics Subject Classification ID: 90-08 / rank | |||
Normal rank | |||
| Property / zbMATH DE Number | |||
| Property / zbMATH DE Number: 6568057 / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
integer programming | |||
| Property / zbMATH Keywords: integer programming / rank | |||
Normal rank | |||
| Property / zbMATH Keywords | |||
performance variability | |||
| Property / zbMATH Keywords: performance variability / rank | |||
Normal rank | |||
Revision as of 14:33, 27 June 2023
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improving branch-and-cut performance by random sampling |
scientific article |
Statements
Improving branch-and-cut performance by random sampling (English)
0 references
13 April 2016
0 references
integer programming
0 references
performance variability
0 references
