A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems (Q1754103): 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.ejor.2017.09.026 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2756508720 / rank | |||
Normal rank | |||
Revision as of 22:24, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems |
scientific article |
Statements
A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems (English)
0 references
30 May 2018
0 references
multiple objective programming
0 references
integer programming
0 references
