An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
type: Item
instance of: scholarly article
title: An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
zbMATH Open document ID: 1467.90058
author: Angelo Aliano Filho
author: Antonio Carlos Moretti
author: Margarida Vaz Pato
author: Washington Alves de Oliveira
published in: Annals of Operations Research
publication date: 2021-05-05T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 7344060
zbMATH Keywords: bi-objective optimization problems
zbMATH Keywords: integer linear optimization
zbMATH Keywords: exact scalarization methods
describes a project that uses: NBI
MaRDI profile type: Publication
full work available at URL: s10479-019-03317-9
OpenAlex ID: W2963948689
cites work: Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
cites work: The joint economic lot sizing problem: review and extensions
cites work: Existence of efficient solutions for vector maximization problems
cites work: An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
cites work: An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
cites work: Multiobjective optimization. Interactive and evolutionary approaches
cites work: Q4387178
cites work: Q3567139
cites work: Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization
cites work: Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
cites work: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
cites work: A two-stage approach for bi-objective integer linear programming
cites work: Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
cites work: Multi-objective optimization using evolutionary algorithms
cites work: Multicriteria Optimization
cites work: A survey and annotated bibliography of multiobjective combinatorial optimization
cites work: Q4670576
cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: The double role of the weight factor in the goal programming model
cites work: An algorithm for the multiple objective integer linear programming problem
cites work: An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
cites work: Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems
cites work: Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming
cites work: A two-slope achievement scalarizing function for interactive multiobjective optimization
cites work: Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
cites work: The normalized normal constraint method for generating the Pareto frontier
cites work: Nonlinear multiobjective optimization
cites work: On the Use of Preferential Weights in Interactive Reference Point Based Methods
cites work: g-dominance: Reference point based dominance for multiobjective metaheuristics
cites work: Three algorithms for bicriteria integer linear programs
cites work: A branch-and-cut technique to solve multiobjective integer quadratic programming problems
cites work: Multi-objective integer programming: a general approach for generating all non-dominated solutions
cites work: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
cites work: An improved algorithm for solving biobjective integer programs
cites work: Approximation methods in multiobjective programming
cites work: A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing
cites work: The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
cites work: Norm-based approximation in bicriteria programming
cites work: Discrete representation of non-dominated sets in multi-objective linear programming
cites work: Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
cites work: An interactive weighted Tchebycheff procedure for multiple objective programming
cites work: A method for finding the set of non-dominated vectors for multiple objective integer linear programs
cites work: Q3875728
Wikidata QID: Q127440177
DOI: 10.1007/S10479-019-03317-9
Recommended article: Q5151618
Recommended article: An exact algorithm for biobjective mixed integer linear programming problems
Recommended article: Q5127574
Recommended article: Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
Recommended article: A reference direction approach to multiple objective integer linear programming
Recommended article: A discussion of scalarization techniques for multiple objective integer programming
Recommended article: A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
Recommended article: A combined scalarizing method for multiobjective programming problems
Recommended article: A two-stage approach for bi-objective integer linear programming
Recommended article: A combined scalarization method for multi-objective optimization problems