An interactive approach for biobjective integer programs under quasiconvex preference functions
From MaRDI portal
Recommendations
- An interactive integrated multiobjective optimization approach for quasiconcave/quasiconvex utility functions
- scientific article; zbMATH DE number 124837
- An interactive method for bicriteria integer programming
- Interactive bi-level multi-objective integer non-linear programming problem
- An interactive approximation algorithm for multi-objective integer programs
- An interactive algorithm to find the most preferred solution of multi-objective integer programs
- An interactive branch-and-bound algorithm for bicriterion nonconvex/mixed integer programming
- scientific article; zbMATH DE number 3978851
- An exact interactive method for exploring the efficient facets of multiple objective linear programming problems with quasi-concave utility functions
- Biobjective programming in optimization of interval linear programming
Cites work
- scientific article; zbMATH DE number 4010155 (Why is no real title available?)
- scientific article; zbMATH DE number 4085440 (Why is no real title available?)
- scientific article; zbMATH DE number 1975100 (Why is no real title available?)
- A multiple criteria method for choosing among discrete alternatives
- An exact -constraint method for bi-objective combinatorial optimization problems: Application to the traveling salesman problem with profits
- An interactive algorithm for multi-objective route planning
- An interactive algorithm to find the most preferred solution of multi-objective integer programs
- An interactive method for bicriteria integer programming
- Integer Programming Formulation of Traveling Salesman Problems
- Interactive Approaches for Discrete Alternative Multiple Criteria Decision Making with Monotone Utility Functions
- Multi-objective meta-heuristics for the traveling salesman problem with profits
- Multicriteria Optimization
- Multiobjective traveling salesperson problem on Halin graphs
- On the cardinality of the Pareto set in bicriteria shortest path problems
- Pareto memetic algorithm with path relinking for bi-objective traveling salesperson problem
- Performance of the MOSA method for the bicriteria assignment problem
- Pyramidal tours and multiple objectives
- Solving the Discrete Multiple Criteria Problem using Convex Cones
- The multiobjective traveling salesman problem: A survey and a new approach
- The traveling salesman problem: An overview of exact and approximate algorithms
- Two phase algorithms for the bi-objective assignment problem
- Use of substitute scalarizing functions to guide a local search based heuristic: the case of moTSP
Cited in
(9)- PGA/MOEAD: a preference-guided evolutionary algorithm for multi-objective decision-making problems with interval-valued fuzzy preferences
- 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
- A flexible reference point-based multi-objective evolutionary algorithm: an application to the UAV route planning problem
- An interactive polyhedral approach for multi-objective combinatorial optimization with incomplete preference information
- Biobjective UAV routing for a mission to visit multiple mobile targets
- scientific article; zbMATH DE number 124837 (Why is no real title available?)
- An interactive integrated multiobjective optimization approach for quasiconcave/quasiconvex utility functions
- An interactive approximation algorithm for multi-objective integer programs
This page was built for publication: An interactive approach for biobjective integer programs under quasiconvex preference functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q512966)
