The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
From MaRDI portal
Publication:3115933
DOI10.1287/mnsc.1050.0413zbMath1232.90331OpenAlexW2048331087MaRDI QIDQ3115933
Publication date: 21 February 2012
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.1050.0413
Related Items (27)
An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ Dominance for multi-objective robust optimization concepts ⋮ Algorithm robust for the bicriteria discrete optimization problem ⋮ Bilevel programming for generating discrete representations in multiobjective optimization ⋮ An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems ⋮ Nondominated Nash points: application of biobjective mixed integer programming ⋮ Network Models for Multiobjective Discrete Optimization ⋮ On the quality of discrete representations in multiple objective programming ⋮ An exact algorithm for biobjective integer programming problems ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ Weighted robust optimality of convex optimization problems with data uncertainty ⋮ Generating equidistant representations in biobjective programming ⋮ Exploring the trade-off between generalization and empirical errors in a one-norm SVM ⋮ Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization ⋮ Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems ⋮ Finding representative systems for discrete bicriterion optimization problems ⋮ Finding representations for an unconstrained bi-objective combinatorial optimization problem ⋮ An enhanced exact procedure for the absolute robust shortest path problem ⋮ An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits ⋮ A unified approach to uncertain optimization ⋮ Using support vector machines to learn the efficient set in multiple objective discrete optimization ⋮ A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems ⋮ A scalarization scheme for binary relations with applications to set-valued and robust optimization ⋮ Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts ⋮ A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems ⋮ On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization
This page was built for publication: The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
