Pages that link to "Item:Q1873011"
From MaRDI portal
The following pages link to Solving biobjective combinatorial max-ordering problems by ranking methods and a two-phases approach (Q1873011):
Displaying 6 items.
- An efficient procedure for finding best compromise solutions to the multi-objective assignment problem (Q342019) (← links)
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization (Q1713738) (← links)
- Exact algorithms for OWA-optimization in multiobjective spanning tree problems (Q1762141) (← links)
- Algorithm robust for the bicriteria discrete optimization problem (Q2379865) (← links)
- A decision-theoretic approach to robust optimization in multivalued graphs (Q2379879) (← links)
- Computing all efficient solutions of the biobjective minimum spanning tree problem (Q2384598) (← links)
