A simple finite cutting plane algorithm for integer programs (Q1939718): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Page cuts for integer interval linear programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A finiteness proof for modified dantzig cuts in integer programming / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Outline of an algorithm for integer solutions to linear programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A finitely converging cutting plane technique / rank | |||
Normal rank | |||
Latest revision as of 06:32, 6 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A simple finite cutting plane algorithm for integer programs |
scientific article |
Statements
A simple finite cutting plane algorithm for integer programs (English)
0 references
5 March 2013
0 references
integer programming
0 references
cutting plane algorithm
0 references
finiteness
0 references
