On combinatorial optimization problems on matroids with uncertain weights

DOI10.1016/J.EJOR.2005.12.033MaRDI QIDQ856278zbMATH OpenOpenAlexFDO

Authors Adam Kasperski, Paweł Zieliński

Publication date 7 December 2006

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ejor.2005.12.033

zbMATH Keywords

combinatorial optimizationintervalmatroidpossibility theoryfuzzy interval

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids
• Some methods for evaluating the optimality of elements in matroids with ill-known weights
• Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids
• Possibilistic bottleneck combinatorial optimization problems with ill-known weights
• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights

Cites work

• scientific article; zbMATH DE number 420868 (Why is no real title available?)
• scientific article; zbMATH DE number 193123 (Why is no real title available?)
• scientific article; zbMATH DE number 1219584 (Why is no real title available?)
• An approximation algorithm for interval data minmax regret combinatorial optimization problems
• An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
• Critical path analysis in the network with fuzzy activity times
• Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
• Fuzzy sets
• Fuzzy shortest path problems incorporating interactivity among paths.
• Interval Analysis in Scheduling
• Interval data minmax regret network optimization problems
• Network flows. Theory, algorithms, and applications.
• On the complexity of a class of combinatorial optimization problems with uncertainty
• Operations on fuzzy numbers
• Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.
• Robust discrete optimization and its applications
• Some concepts of stability analysis in combinatorial optimization
• The computational complexity of the criticality problems in a network with interval activity times
• The robust spanning tree problem with interval data

Cited in

(14)

• Connectedness of refined Goetschel-Voxman fuzzy matroids
• Some methods for evaluating the optimality of elements in matroids with ill-known weights
• A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids
• Possibilistic bottleneck combinatorial optimization problems with ill-known weights
• The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
• Axioms for bases of closed regular fuzzy matroids
• The minimum spanning tree problem with fuzzy costs
• A new approach to the fuzzification of matroids
• \((L,M)\)-fuzzy matroids
• The free product of \(M\)-fuzzifying matroids
• Efficient Methods for Computing Optimality Degrees of Elements in Fuzzy Weighted Matroids
• On the enumeration of non-dominated matroids with imprecise weights
• Optimization problems with evidential linear objective
• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights

This page was built for publication: On combinatorial optimization problems on matroids with uncertain weights

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