Cutting planes from a mixed integer Farkas lemma. (Q1426721): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q124962584, #quickstatements; #temporary_batch_1711574657256 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4149476 / 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: Q3818127 / rank | |||
Normal rank | |||
Revision as of 15:00, 6 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Cutting planes from a mixed integer Farkas lemma. |
scientific article |
Statements
Cutting planes from a mixed integer Farkas lemma. (English)
0 references
15 March 2004
0 references
Mixed-integer linear programming
0 references
Lattice bases
0 references
Cutting planes
0 references
