On improvements of multi-objective branch and bound
Branch and bound methods which are based on the principle “divide and conquer” are a well established solution approach in single-objective integer programming. In multi-objective optimization, branch and bound algorithms are increasingly attracting interest. However, the larger number of objectives...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Elsevier
2024-01-01
|
| Series: | EURO Journal on Computational Optimization |
| Subjects: | |
| Online Access: | http://www.sciencedirect.com/science/article/pii/S2192440624000169 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|