Finding non dominated points for multiobjective integer convex programs with linear constraints (Q2162515)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding non dominated points for multiobjective integer convex programs with linear constraints |
scientific article |
Statements
Finding non dominated points for multiobjective integer convex programs with linear constraints (English)
0 references
8 August 2022
0 references
multiobjective convex programming
0 references
non dominated point
0 references
multiobjective quadratic programming
0 references
branch-and-bound
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
