Finding representations for an unconstrained bi-objective combinatorial optimization problem

DOI10.1007/s11590-017-1129-6zbMath1400.90260OpenAlexW2597612688MaRDI QIDQ1744630

Luís Paquete, Alexandre D. Jesus, José Rui Figueira

Publication date: 19 April 2018

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11590-017-1129-6

zbMATH Keywords

dynamic programmingmultiobjective combinatorial optimizationrepresentation problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (2)

Computing representations using hypervolume scalarizations ⋮ A model of anytime algorithm performance for bi-objective optimization

Cites Work

• On finding representative non-dominated points for bi-objective integer network flow problems
• Representation of the non-dominated set in biobjective discrete optimization
• Measuring the quality of discrete representations of efficient sets in multiple objective mathematical programming
• Approximate Pareto sets of minimal size for multi-objective optimization problems
• Finding representative systems for discrete bicriterion optimization problems
• Discrete Dynamic Programming and Capital Allocation
• The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
• Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems
• A Procedure to Find Discrete Representations of the Efficient Set with Specified Coverage Errors
• Parametric Solution for Linear Bicriteria Knapsack Models
• Multicriteria Optimization
• Discrete-Variable Extremum Problems
• Random knapsack in expected polynomial time

This page was built for publication: Finding representations for an unconstrained bi-objective combinatorial optimization problem