Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology (Q2204444): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.cnsns.2020.105177 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3000250712 / rank | |||
Normal rank | |||
Revision as of 02:46, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology |
scientific article |
Statements
Solving the lexicographic multi-objective mixed-integer linear programming problem using branch-and-bound and grossone methodology (English)
0 references
15 October 2020
0 references
multi-objective optimization
0 references
lexicographic optimization
0 references
mixed integer linear programming
0 references
numerical infinitesimals
0 references
grossone methodology
0 references
