Solving pseudo-convex mixed integer optimization problems by cutting plane techniques (Q1863894): Difference between revisions
From MaRDI portal
Created a new Item |
Set profile property. |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / describes a project that uses | |||
| Property / describes a project that uses: AlphaECP / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 04:59, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving pseudo-convex mixed integer optimization problems by cutting plane techniques |
scientific article |
Statements
Solving pseudo-convex mixed integer optimization problems by cutting plane techniques (English)
0 references
12 March 2003
0 references
optimization
0 references
mixed-integer nonlinear programming
0 references
integer nonlinear programming
0 references
quasiconvex functions
0 references
pseudo-convex functions
0 references
non-convex MINLP problems
0 references
extended cutting plane method
0 references
