An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
From MaRDI portal
(Redirected from Publication:828841)
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
- scientific article; zbMATH DE number 5719847 (Why is no real title available?)
- scientific article; zbMATH DE number 3679573 (Why is no real title available?)
- scientific article; zbMATH DE number 1149798 (Why is no real title available?)
- scientific article; zbMATH DE number 2160609 (Why is no real title available?)
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A Linear Programming Approach to the Cutting-Stock Problem
- A branch-and-cut technique to solve multiobjective integer quadratic programming problems
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A lexicographic approach to bi-objective scheduling of single-period orders in make-to-order manufacturing
- A method for finding the set of non-dominated vectors for multiple objective integer linear programs
- A survey and annotated bibliography of multiobjective combinatorial optimization
- A two-slope achievement scalarizing function for interactive multiobjective optimization
- A two-stage approach for bi-objective integer linear programming
- An algorithm for the multiple objective integer linear programming problem
- An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- An improved algorithm for solving biobjective integer programs
- An interactive weighted Tchebycheff procedure for multiple objective programming
- An outer approximation algorithm for generating all efficient extreme points in the outcome set of a multiple objective linear programming problem
- Approximation methods in multiobjective programming
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Computational Results for Four Exact Methods to Solve the Three-Objective Assignment Problem
- Discrete representation of non-dominated sets in multi-objective linear programming
- Existence of efficient solutions for vector maximization problems
- Generating the noninferior set in mixed integer biobjective linear programs: An application to a location problem
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- Interactive polyhedral outer approximation (IPOA) strategy for general multiobjective optimization problems
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
- Modified interactive Chebyshev algorithm (MICA) for non-convex multiobjective programming
- Multi-objective integer programming: a general approach for generating all non-dominated solutions
- Multi-objective optimization using evolutionary algorithms
- Multicriteria Optimization
- Multiobjective optimization. Interactive and evolutionary approaches
- Nonlinear multiobjective optimization
- Norm-based approximation in bicriteria programming
- Normal-Boundary Intersection: A New Method for Generating the Pareto Surface in Nonlinear Multicriteria Optimization Problems
- On the use of preferential weights in interactive reference point based methods
- Pareto simulated annealing—a metaheuristic technique for multiple‐objective combinatorial optimization
- The double role of the weight factor in the goal programming model
- The joint economic lot sizing problem: review and extensions
- 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
- Three algorithms for bicriteria integer linear programs
- Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization
- g-dominance: Reference point based dominance for multiobjective metaheuristics
Cited in
(4)- Correction to: ``An exact scalarization method with multiple reference points for bi-objective Integer linear optimization problems
- Exact method based on solution space cut for bi-objective Seru production
- A bi-integrated model for coupling lot-sizing and cutting-stock problems
- A discussion of scalarization techniques for multiple objective integer programming
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)
