Solving partially integer-valued optimization problems which are convex relative to a continuous variable (Q3942754): Difference between revisions
From MaRDI portal
Removed claim: author (P16): Item:Q424644 |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / author | |||
Property / author: Ivan V. Sergienko / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3875693 / rank | |||
Normal rank |
Latest revision as of 15:33, 13 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Solving partially integer-valued optimization problems which are convex relative to a continuous variable |
scientific article |
Statements
Solving partially integer-valued optimization problems which are convex relative to a continuous variable (English)
0 references
1981
0 references
extension of Benders' method
0 references
existence of optimal solution
0 references
approximate algorithms
0 references
partially integer-valued optimization problem
0 references
approximate solution
0 references
partially convex problem
0 references
Benders' decomposition
0 references
exact solution
0 references