An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs (Q3932587): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Set-Covering Problem: A New Implicit Enumeration Algorithm / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Covering Relaxation for Positive 0-1 Polynomial Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs / rank | |||
Normal rank | |||
Latest revision as of 13:46, 13 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs |
scientific article |
Statements
An accelerated covering relaxation algorithm for solving 0–1 positive polynomial programs (English)
0 references
1982
0 references
accelerated algorithm
0 references
0-1 positive polynomial problems
0 references
cutting plane
0 references
linear set covering problem
0 references
heuristic solutions
0 references
computational results
0 references
nonlinear integer programming
0 references
