An interactive approach for biobjective integer programs under quasiconvex preference functions

DOI10.1007/s10479-016-2149-9zbMath1357.90142OpenAlexW2294595309MaRDI QIDQ512966

Diclehan Tezcaner Öztürk, Murat M. Köksalan

Publication date: 3 March 2017

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10479-016-2149-9

zbMATH Keywords

combinatorial optimizationmultiobjective decision makinginteractive methodbiobjective traveling salesperson problem

Mathematics Subject Classification ID

Integer programming (90C10) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (5)

UAV routing for reconnaissance mission: a multi-objective orienteering problem with time-dependent prizes and multiple connections ⋮ An evolutionary approach to generalized biobjective traveling salesperson problem ⋮ Biobjective UAV routing for a mission to visit multiple mobile targets ⋮ PGA/MOEAD: a preference-guided evolutionary algorithm for multi-objective decision-making problems with interval-valued fuzzy preferences ⋮ A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An interactive algorithm to find the most preferred solution of multi-objective integer programs
• Pyramidal tours and multiple objectives
• An interactive algorithm for multi-objective route planning
• Multi-objective meta-heuristics for the traveling salesman problem with profits
• An exact \(\epsilon\)-constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
• Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
• A multiple criteria method for choosing among discrete alternatives
• The traveling salesman problem: An overview of exact and approximate algorithms
• Multiobjective traveling salesperson problem on Halin graphs
• On the cardinality of the Pareto set in bicriteria shortest path problems
• Two phase algorithms for the bi-objective assignment problem
• Performance of the MOSA method for the bicriteria assignment problem
• Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
• Solving the Discrete Multiple Criteria Problem using Convex Cones
• Integer Programming Formulation of Traveling Salesman Problems
• An interactive method for bicriteria integer programming
• The Multiobjective Traveling Salesman Problem: A Survey and a New Approach
• Interactive Approaches for Discrete Alternative Multiple Criteria Decision Making with Monotone Utility Functions
• Multicriteria Optimization

This page was built for publication: An interactive approach for biobjective integer programs under quasiconvex preference functions