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
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.ejor.2017.09.026 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.EJOR.2017.09.026 / rank | |||
Normal rank | |||
Latest revision as of 08:23, 11 December 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
0 references
0 references
0 references
