Finding representations for an unconstrained bi-objective combinatorial optimization problem
From MaRDI portal
Recommendations
- Representation of the non-dominated set in biobjective discrete optimization
- Compressed data structures for bi-objective \(\{0,1\}\)-knapsack problems
- A method for selecting Pareto optimal solutions in multiobjective optimization
- Computing representations using hypervolume scalarizations
- On finding representative non-dominated points for bi-objective integer network flow problems
Cites work
- A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
- Approximate Pareto sets of minimal size for multi-objective optimization problems
- Discrete dynamic programming and capital allocation
- Discrete-variable extremum problems
- Finding representative systems for discrete bicriterion optimization problems
- Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
- Multicriteria Optimization
- On finding representative non-dominated points for bi-objective integer network flow problems
- Parametric Solution for Linear Bicriteria Knapsack Models
- Random knapsack in expected polynomial time
- Representation of the non-dominated set in biobjective discrete optimization
- Small approximate Pareto sets for biobjective shortest paths and other problems
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
Cited in
(3)
This page was built for publication: Finding representations for an unconstrained bi-objective combinatorial optimization problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1744630)
