On Solving Fully Rough Multi-Objective Integer Linear Programming Problems
In this paper a suggested algorithm to solve fully rough multi-objectiveinteger linear programming problem [FRMOILP] is described. In orderto solve this problem and find rough value efficient solutions anddecision rough integer variables by the slice-sum method with thebranch and bound technique, we...
Uloženo v:
| Hlavní autoři: | , |
|---|---|
| Médium: | Artigo |
| Jazyk: | Inglês |
| Vydáno: |
Tanta University, Faculty of Sciences
2019-06-01
|
| Edice: | Delta Journal of Science |
| Témata: | |
| On-line přístup: | https://djs.journals.ekb.eg/article_139224_10c8038cb39d3a86375d7713b16d9c56.pdf |
| Tagy: |
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|