A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization
From MaRDI portal
Cites work
- A polynomial delay algorithm for generating connected induced subgraphs of a given cardinality
- Algorithmic improvements on dynamic programming for the bi-objective \(\{0,1\}\) knapsack problem
- An analysis of approximations for maximizing submodular set functions—I
- Approximately dominating representatives
- Computing representations using hypervolume scalarizations
- Discrete representation of the non-dominated set for multi-objective optimization problems using kernels
- Discrete-variable extremum problems
- Efficient computation of the search region in multi-objective optimization
- Enumerating connected induced subgraphs: improved delay and experimental comparison
- Implicit enumeration strategies for the hypervolume subset selection problem
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multicriteria Optimization
- On the rectangular knapsack problem: approximation of a specific quadratic knapsack problem
- On the representation of the search region in multi-objective optimization
- Representation of the non-dominated set in biobjective discrete optimization
- Reverse search for enumeration
- SMS-EMOA: multiobjective selection based on dominated hypervolume
- Solving efficiently the 0-1 multi-objective knapsack problem
- Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
This page was built for publication: A greedy hypervolume polychotomic scheme for multiobjective combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6891427)
