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.021zbMath1349.90732OpenAlexW2005246685MaRDI QIDQ339623
Kathrin Klamroth, Kerstin Dächert, Jochen Gorski
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
Related Items (15)
An approach to determine unsupported non-dominated solutions in bicriteria integer linear programs ⋮ Generation of the exact Pareto set in multi-objective traveling salesman and set covering problems ⋮ An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems ⋮ A hybrid approach for biobjective optimization ⋮ 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 ⋮ A Feasibility Pump and Local Search Based Heuristic for Bi-Objective Pure Integer Linear Programming ⋮ A New Exact Algorithm to Optimize a Linear Function over the Set of Efficient Solutions for Biobjective Mixed Integer Linear Programs ⋮ Variants of the \(\varepsilon\)-constraint method for biobjective integer programming problems: application to \(p\)-median-cover problems ⋮ Bi-objective autonomous vehicle repositioning problem with travel time uncertainty ⋮ Multi-objective optimization based algorithms for solving mixed integer linear minimum multiplicative programs ⋮ Solving discrete multi-objective optimization problems using modified augmented weighted Tchebychev scalarizations ⋮ A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method ⋮ FPBH: a feasibility pump based heuristic for multi-objective mixed integer linear programming ⋮ A linear bound on the number of scalarizations needed to solve discrete tricriteria optimization problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pyramidal tours and multiple objectives
- A review of interactive methods for multiobjective integer and mixed-integer programming
- Improved \(\varepsilon\)-constraint method for multiobjective programming
- Effective implementation of the \(\varepsilon \)-constraint method in multi-objective mathematical programming problems
- Algorithms for nonlinear integer bicriterion problems
- Nonlinear multiobjective optimization
- Norm-based approximation in multicriteria programming.
- An interactive reference point approach for multiobjective mixed-integer programming using branch-and-bound
- Unbiased approximation in multicriteria optimization
- Using trade-off information in decision-making algorithms
- Modified interactive Chebyshev algorithm (MICA) for convex multiobjective programming
- 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
- The Multiobjective Discrete Optimization Problem: A Weighted Min-Max Two-Stage Optimization Approach and a Bicriteria Algorithm
- Solving min-max shortest-path problems on a network
- An interactive weighted Tchebycheff procedure for multiple objective programming
- Multicriteria Optimization
This page was built for publication: An augmented weighted Tchebycheff method with adaptively chosen parameters for discrete bicriteria optimization problems
