Pages that link to "Item:Q3115933"
From MaRDI portal
The following pages link to The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm (Q3115933):
Displaying 27 items.
- On robust optimization. Relations between scalar robust optimization and unconstrained multicriteria optimization (Q262007) (← links)
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems (Q339623) (← links)
- On the quality of discrete representations in multiple objective programming (Q374696) (← links)
- Generating equidistant representations in biobjective programming (Q429518) (← links)
- Exploring the trade-off between generalization and empirical errors in a one-norm SVM (Q439563) (← links)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems (Q828841) (← links)
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits (Q953423) (← links)
- Using support vector machines to learn the efficient set in multiple objective discrete optimization (Q958095) (← links)
- Dominance for multi-objective robust optimization concepts (Q1622793) (← links)
- Bilevel programming for generating discrete representations in multiobjective optimization (Q1646577) (← links)
- Nondominated Nash points: application of biobjective mixed integer programming (Q1653352) (← links)
- Finding representations for an unconstrained bi-objective combinatorial optimization problem (Q1744630) (← links)
- A unified approach to uncertain optimization (Q1753451) (← links)
- A scalarization scheme for binary relations with applications to set-valued and robust optimization (Q2022231) (← links)
- Weighted robust optimality of convex optimization problems with data uncertainty (Q2191283) (← links)
- A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems (Q2255968) (← links)
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems (Q2342947) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems (Q2442076) (← links)
- Finding representative systems for discrete bicriterion optimization problems (Q2467474) (← links)
- An exact algorithm for biobjective integer programming problems (Q2668742) (← links)
- Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization (Q2669645) (← links)
- A unified approach for different concepts of robustness and stochastic programming via non-linear scalarizing functionals (Q2841149) (← links)
- Proper Efficiency and Tradeoffs in Multiple Criteria and Stochastic Optimization (Q2976144) (← links)
- An enhanced exact procedure for the absolute robust shortest path problem (Q3563623) (← links)
- Network Models for Multiobjective Discrete Optimization (Q5086002) (← links)
- Robustness for uncertain multi-objective optimization: a survey and analysis of different concepts (Q5964853) (← links)
