Choquet optimal set in biobjective combinatorial optimization

DOI10.1016/J.COR.2013.04.003zbMATH Open1348.90563OpenAlexW2080496315MaRDI QIDQ336494FDOQ336494

Authors: Thibaut Lust, Antoine Rolland 

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2013.04.003

Recommendations

• Bound sets for biobjective combinatorial optimization problems
• scientific article; zbMATH DE number 1784662
• Biobjective optimization over the efficient set of multiobjective integer programming problem
• On combinatorial optimization motivated by biology
• Biobjective robust optimization over the efficient set for Pareto set reduction
• Biobjective optimization problems on matroids with binary costs
• scientific article; zbMATH DE number 2160609
• On some multiobjective optimization problems arising in biology
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems

zbMATH Keywords

Choquet integralknapsack problemmultiobjective optimizationalgorithmic decision theoryminimum spanning tree problem

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Fuzzy measure theory (28E10)

Cites Work

• A review of methods for capacity identification in Choquet integral based multi-attribute utility theory: applications of the Kappalab R package
• On the shortest spanning subtree of a graph and the traveling salesman problem
• Aggregation functions.
• On ordered weighted averaging aggregation operators in multicriteria decisionmaking
• Multicriteria Optimization
• On a Bicriterion Formulation of the Problems of Integrated System Identification and System Optimization
• Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
• Two phase algorithms for the bi-objective assignment problem
• Theory of capacities
• A decade of application of the Choquet and Sugeno integrals in multi-criteria decision aid
• A Minimal Algorithm for the 0-1 Knapsack Problem
• Bicriteria Transportation Problem
• On a multicriteria shortest path problem
• Solving efficiently the 0-1 multi-objective knapsack problem
• A two-phase algorithm for the biobjective integer minimum cost flow problem
• The multiobjective multidimensional knapsack problem: a survey and a new approach
• Title not available (Why is that?)
• Inequality measures and equitable approaches to location problems
• A recursive algorithm for finding all nondominated extreme points in the outcome set of a multiobjective integer programme
• The weighted OWA operator
• Shortest chain subject to side constraints
• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• A branch and bound algorithm for Choquet optimization in multicriteria problems
• Title not available (Why is that?)

Cited In (8)

• Choquet-based optimisation in multiobjective shortest path and spanning tree problems
• A lower bound of the Choquet integral integrated within martins' algorithm
• Title not available (Why is that?)
• 2-additive Choquet optimal solutions in multiobjective optimization problems
• An interactive polyhedral approach for multi-objective combinatorial optimization with incomplete preference information
• Choquet integral optimisation with constraints and the buoyancy property for fuzzy measures
• Compact versus noncompact LP formulations for minimizing convex Choquet integrals
• A branch and bound algorithm for Choquet optimization in multicriteria problems

Uses Software

• Knapsack
• kappalab

This page was built for publication: Choquet optimal set in biobjective combinatorial optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q336494)