An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
From MaRDI portal
Publication:828841
DOI10.1007/S10479-019-03317-9zbMATH Open1467.90058OpenAlexW2963948689WikidataQ127440177 ScholiaQ127440177MaRDI QIDQ828841FDOQ828841
Margarida Vaz Pato, Antonio Carlos Moretti, Washington Alves de Oliveira, Angelo Aliano Filho
Publication date: 5 May 2021
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-019-03317-9
Recommendations
- A nonlinear scalarization method for multi-objective optimization problems
- An exact algorithm for biobjective mixed integer linear programming problems
- scientific article; zbMATH DE number 7266699
- Linear and conic scalarizations for obtaining properly efficient solutions in multiobjective optimization
- A reference direction approach to multiple objective integer linear programming
- A discussion of scalarization techniques for multiple objective integer programming
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
- A combined scalarizing method for multiobjective programming problems
- A two-stage approach for bi-objective integer linear programming
- A combined scalarization method for multi-objective optimization problems
Cites Work
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- A Linear Programming Approach to the Cutting-Stock Problem
- Nonlinear multiobjective optimization
- A two-slope achievement scalarizing function for interactive multiobjective optimization
- Title not available (Why is that?)
- Multicriteria Optimization
- Multi-objective optimization using evolutionary algorithms
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- The normalized normal constraint method for generating the Pareto frontier
- Title not available (Why is that?)
- Multiobjective optimization. Interactive and evolutionary approaches
- An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- g-dominance: Reference point based dominance for multiobjective metaheuristics
- A survey and annotated bibliography of multiobjective combinatorial optimization
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- The double role of the weight factor in the goal programming model
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- An algorithm for the multiple objective integer linear programming problem
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- Approximation methods in multiobjective programming
- Title not available (Why is that?)
- An interactive weighted Tchebycheff procedure for multiple objective programming
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
- The joint economic lot sizing problem: review and extensions
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- Existence of efficient solutions for vector maximization problems
- An improved algorithm for solving biobjective integer programs
- Title not available (Why is that?)
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Discrete representation of non-dominated sets in multi-objective linear programming
- Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization
- On the use of preferential weights in interactive reference point based methods
- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
- Norm-based approximation in bicriteria programming
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems
- Three algorithms for bicriteria integer linear programs
- Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming
- A two-stage approach for bi-objective integer linear programming
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems
- A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing
Cited In (2)
Uses Software
This page was built for publication: An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q828841)
