Minimal cut-generating functions are nearly extreme (Q1801006): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Maximal Lattice-Free Convex Sets in Linear Subspaces / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The triangle closure is a polyhedron / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Minimal Valid Inequalities for Integer Constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the facets of mixed integer programs with two integer variables and two constraints / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Computing with multi-row gomory cuts / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4128251 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4485695 / rank | |||
Normal rank | |||
Latest revision as of 02:16, 17 July 2024
scientific article; zbMATH DE number 6610490
- Minimal Cut-Generating Functions are Nearly Extreme
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Minimal cut-generating functions are nearly extreme |
scientific article; zbMATH DE number 6610490 |
|
Statements
Minimal cut-generating functions are nearly extreme (English)
0 references
Minimal Cut-Generating Functions are Nearly Extreme (English)
0 references
26 October 2018
0 references
10 August 2016
0 references
cut-generating functions
0 references
dense
0 references
