Obtaining the efficient set of nonlinear biobjective optimization problems via interval branch-and-bound methods
- 15 November 2007
- journal article
- research article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 42 (3) , 393-419
Abstract
No abstract availableKeywords
This publication has 34 references indexed in Scilit:
- Obtaining an outer approximation of the efficient set of nonlinear biobjective problemsJournal of Global Optimization, 2007
- Reconciling Franchisor and Franchisee: A Planar Biobjective Competitive Location and Design Model2006
- Mutiobjective Programming2005
- An MCDM approach to portfolio optimizationEuropean Journal of Operational Research, 2004
- Estimating actual distances by norm functions: a comparison between the lk,p,θ-norm and the lb1,b2,θ-norm and a study about the selection of the data setComputers & Operations Research, 2002
- Constructing robust crew schedules with bicriteria optimizationJournal of Multi-Criteria Decision Analysis, 2002
- An interactive multicriteria decision model for multipurpose reservoir management: the Shellmouth ReservoirJournal of Multi-Criteria Decision Analysis, 1998
- Location of a Semiobnoxious Facility. A Biobjective Approach1997
- Facility Location: A Survey of Applications and Methods.Journal of the Operational Research Society, 1996
- Competitive Location Models: A Framework and BibliographyTransportation Science, 1993