On combinatorial optimization problems on matroids with uncertain weights
From MaRDI portal
Publication:856278
DOI10.1016/j.ejor.2005.12.033zbMath1110.90075OpenAlexW2000644364MaRDI QIDQ856278
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
Related Items
Connectedness of refined Goetschel-Voxman fuzzy matroids, Optimization problems with evidential linear objective, Possibilistic bottleneck combinatorial optimization problems with ill-known weights, The free product of M-fuzzifying matroids1, Axioms for bases of closed regular fuzzy matroids, The Minimum Cost Query Problem on Matroids with Uncertainty Areas., The minimum spanning tree problem with fuzzy costs, A new approach to the fuzzification of matroids, Some methods for evaluating the optimality of elements in matroids with ill-known weights, \((L,M)\)-fuzzy matroids, Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An approximation algorithm for interval data minmax regret combinatorial optimization problems
- Robust discrete optimization and its applications
- Fuzzy shortest path problems incorporating interactivity among paths.
- Possible and necessary optimality of solutions in the single machine scheduling problem with fuzzy parameters.
- Some concepts of stability analysis in combinatorial optimization
- Interval data minmax regret network optimization problems
- Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
- An improved algorithm for selecting \(p\) items with uncertain returns according to the minmax-regret criterion
- Interval Analysis in Scheduling
- Operations on fuzzy numbers
- Fuzzy sets
- On the complexity of a class of combinatorial optimization problems with uncertainty
- The robust spanning tree problem with interval data
- Critical path analysis in the network with fuzzy activity times
- The computational complexity of the criticality problems in a network with interval activity times
