Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm
From MaRDI portal
Publication:2098052
Recommendations
- Strategic manipulation behavior in graph model for conflict resolution: the role of social trust network
- A graph model for conflict resolution with inconsistent preferences among large-scale participants
- Combining strength and uncertainty for preferences in the graph model for conflict resolution with multiple decision makers
- Optimizing the cost of preference manipulation in the graph model for conflict resolution
- Graph model for conflict resolution with consistent preference and its application
Cites work
- A biased random key genetic algorithm for the field Technician scheduling problem
- A discrete particle swarm optimization method for feature selection in binary classification problems
- A general hierarchical graph model for conflict resolution with application to greenhouse gas emission disputes between USA and China
- A genetic algorithm for task scheduling on heterogeneous computing systems using multiple priority queues
- A hybrid adaptively genetic algorithm for task scheduling problem in the phased array radar
- A hybrid PSO-GA algorithm for constrained optimization problems
- An effective PSO-inspired algorithm for the team orienteering problem
- Directed particle swarm optimization with Gaussian-process-based function forecasting
- Fuzzy option prioritization for the graph model for conflict resolution
- scientific article; zbMATH DE number 4033548 (Why is no real title available?)
- scientific article; zbMATH DE number 3468861 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- Interval fuzzy preferences in the graph model for conflict resolution
- Matrix representation and extension of coalition analysis in group decision support
- Matrix representations of the inverse problem in the graph model for conflict resolution
- Mixed stabilities for analyzing opponents' heterogeneous behavior within the graph model for conflict resolution
- Modeling and solution of the joint quay crane and truck scheduling problem
- Optimizing the cost of preference manipulation in the graph model for conflict resolution
- Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
- Upper and lower probabilistic preferences in the graph model for conflict resolution
- Using matrices to link conflict evolution and resolution in a graph model
Cited in
(6)- Matrix representations of the inverse problem in the graph model for conflict resolution
- Equilibrium and efficiency in conflict analysis incorporating permissibility
- Strategic manipulation behavior in graph model for conflict resolution: the role of social trust network
- Interrelationships of non-cooperative, classical and Pareto coalitional stability definitions
- Exploring the minimum cost conflict mediation path to a desired resolution within the inverse graph model framework
- Graph model for multiple composite decision makers with large-scale groups: probability-hesitant fuzzy preference modeling and application
This page was built for publication: Solving the inverse graph model for conflict resolution using a hybrid metaheuristic algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2098052)
