An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
From MaRDI portal
Publication:339623
DOI10.1016/J.COR.2012.02.021zbMATH Open1349.90732OpenAlexW2005246685MaRDI QIDQ339623FDOQ339623
Authors: Kerstin Dächert, Jochen Gorski, Kathrin Klamroth 
Publication date: 11 November 2016
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2012.02.021
Recommendations
- Adaptive parametric scalarizations in multicriteria optimization
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- scientific article; zbMATH DE number 3932804
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
Cites Work
- Nonlinear multiobjective optimization
- Title not available (Why is that?)
- Title not available (Why is that?)
- Multicriteria Optimization
- The multiobjective discrete optimization problem: a weighted min-max two-stage optimization approach and a bicriteria algorithm
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Pyramidal tours and multiple objectives
- Solving min-max shortest-path problems on a network
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Title not available (Why is that?)
- A review of interactive methods for multiobjective integer and mixed-integer programming
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
- Algorithms for nonlinear integer bicriterion problems
- Norm-based approximation in multicriteria programming.
- Unbiased approximation in multicriteria optimization
- Using trade-off information in decision-making algorithms
- An improved algorithm for solving biobjective integer programs
- Experiments with classification-based scalarizing functions in interactive multiobjective optimization
- Quantitative comparison of approximate solution sets for multicriteria optimization problems with weighted Tchebycheff preference function
Cited In (20)
- An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems
- FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming
- Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems
- Adaptive parametric scalarizations in multicriteria optimization
- Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems
- Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations
- Bi-objective autonomous vehicle repositioning problem with travel time uncertainty
- The augmented weighted Tchebychev norm for optimizing a linear function over an integer efficient set of a multicriteria linear program
- A two-stage approach for bi-objective integer linear programming
- Bi‐objective optimization of the tactical allocation of job types to machines: mathematical modeling, theoretical analysis, and numerical tests
- The weighted \(p\)-norm weight set decomposition for multiobjective discrete optimization problems
- A simple, efficient and versatile objective space algorithm for multiobjective integer programming
- Augmenting bi-objective branch and bound by scalarization-based information
- An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs
- A hybrid approach for biobjective optimization
- A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming
- Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs
- A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
- A criterion space search algorithm for biobjective integer programming: the balanced box method
- A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs
This page was built for publication: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q339623)
