Bilinear programming: An exact algorithm (Q4138491): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Intersection Cuts—A New Type of Cutting Planes for Integer Programming / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Convexity Cuts and Cut Search / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5547252 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4404428 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5342287 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Nonlinear Programming: Counterexamples to Two Global Optimization Algorithms / rank | |||
Normal rank |
Latest revision as of 21:02, 12 June 2024
scientific article; zbMATH DE number 3566558
Language | Label | Description | Also known as |
---|---|---|---|
English | Bilinear programming: An exact algorithm |
scientific article; zbMATH DE number 3566558 |
Statements
Bilinear programming: An exact algorithm (English)
0 references
1977
0 references