Generating convex polynomial inequalities for mixed 0-1 programs (Q1810867): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: Publication / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1020351410169 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1479930027 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 09:51, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Generating convex polynomial inequalities for mixed 0-1 programs |
scientific article |
Statements
Generating convex polynomial inequalities for mixed 0-1 programs (English)
0 references
9 June 2003
0 references
Mixed integer programming
0 references
Convex programming
0 references
Semidefinite programming
0 references
Mixed integer nonlinear programming
0 references
Mixed integer convex programming
0 references
