On combinatorial optimization problems on matroids with uncertain weights
From MaRDI portal
Publication:856278
DOI10.1016/J.EJOR.2005.12.033zbMATH Open1110.90075OpenAlexW2000644364MaRDI QIDQ856278FDOQ856278
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
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
- Network flows. Theory, algorithms, and applications.
- Fuzzy sets
- Title not available (Why is that?)
- Title not available (Why is that?)
- Robust discrete optimization and its applications
- Title not available (Why is that?)
- Interval data minmax regret network optimization problems
- Some concepts of stability analysis in combinatorial optimization
- Operations on fuzzy numbers
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
- Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Fuzzy shortest path problems incorporating interactivity among paths.
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- The computational complexity of the criticality problems in a network with interval activity times
- Critical path analysis in the network with fuzzy activity times
- Interval Analysis in Scheduling
- Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.
Cited In (14)
- Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
- A Possibilistic Approach to Combinatorial Optimization Problems on Fuzzy-Valued Matroids
- The Minimum Cost Query Problem on Matroids with Uncertainty Areas.
- Axioms for bases of closed regular fuzzy matroids
- Possibilistic bottleneck combinatorial optimization problems with ill-known weights
- 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
- Connectedness of refined Goetschel-Voxman fuzzy matroids
- Optimization problems with evidential linear objective
- On the enumeration of non-dominated matroids with imprecise weights
- 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
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)
