A Branch & Cut Algorithm to Compute Nondominated Solutions in MOLFP via Reference Points
From MaRDI portal
Publication:5232839
DOI10.1007/978-3-642-20009-0_56zbMath1421.90168OpenAlexW2125015708WikidataQ57664306 ScholiaQ57664306MaRDI QIDQ5232839
João Paulo Costa, Maria João Alves
Publication date: 13 September 2019
Published in: Operations Research Proceedings (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20009-0_56
Related Items
Uses Software
Cites Work
- Unnamed Item
- A branch-and-bound algorithm for maximizing the sum of several linear ratios
- A reference point technique to compute nondominated solutions in MOLFP
- A simple method for obtaining weakly efficient points in multiobjective linear fractional programming problems
- Programming with linear fractional functionals
This page was built for publication: A Branch & Cut Algorithm to Compute Nondominated Solutions in MOLFP via Reference Points