Possibilistic bottleneck combinatorial optimization problems with ill-known weights

DOI10.1016/J.IJAR.2011.01.003zbMATH Open1242.90195OpenAlexW2044077650MaRDI QIDQ433509FDOQ433509

Authors: Adam Kasperski, Paweł Zieliński 

Publication date: 5 July 2012

Published in: International Journal of Approximate Reasoning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ijar.2011.01.003

Recommendations

• Bottleneck combinatorial optimization problems with uncertain costs and the OWA criterion
• On the problem of possibilistic-probabilistic optimization with constraints on possibility/probability
• On weighted vs unweighted versions of combinatorial optimization problems
• Probabilistic combinatorial optimization
• Computational combinatorial optimization. Optimal of probably near-optimal solutions
• The problem of possibilistic-probabilistic optimization
• Solving chance-constrained combinatorial problems to optimality
• Bottleneck combinatorial optimization problems with fuzzy scenarios
• On combinatorial optimization problems on matroids with uncertain weights
• Combinatorial optimization under uncertainty

zbMATH Keywords

intervalrobust optimizationpossibility theorybottleneck combinatorial optimizationfuzzy interval

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Fuzzy and other nonstochastic uncertainty mathematical programming (90C70)

Cites Work

• Network flows. Theory, algorithms, and applications.
• Title not available (Why is that?)
• When upper probabilities are possibility measures
• Robust discrete optimization and its applications
• Robust discrete optimization and network flows
• Title not available (Why is that?)
• Introduction to Stochastic Programming
• Stochastic Shortest Paths Via Quasi-convex Maximization
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Interval data minmax regret network optimization problems
• Robustness in operational research and decision aiding: a multi-faceted issue
• Fuzzy scheduling: Modelling flexible constraints vs. coping with incomplete knowledge
• Parametric Combinatorial Computing and a Problem of Program Module Distribution
• Minmax regret solutions for minimax optimization problems with uncertainty
• Complexity of the min-max and min-max regret assignment problems
• A fast algorithm for a class of bottleneck problems
• Algorithms for two bottleneck optimization problems
• Robust optimization under softness in a fuzzy linear programming problem
• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
• On latest starting times and floats in activity networks with ill-known durations
• The Min-Max Spanning Tree Problem and some extensions
• Chance constrained bottleneck spanning tree problem
• Approaches to linear programming problems with interactive fuzzy numbers
• Two-phase algorithms for the parametric shortest path problem
• Title not available (Why is that?)
• Stochastic bottleneck spanning tree problem
• On Possibilistic/Fuzzy Optimization
• Faster parametric shortest path and minimum‐balance algorithms
• A linear time algorithm for the maximum capacity path problem
• On combinatorial optimization problems on matroids with uncertain weights

Cited In (5)

• Distributionally robust bottleneck combinatorial problems: uncertainty quantification and robust decision making
• Minmax regret approach and optimality evaluation in combinatorial optimization problems with interval and fuzzy weights
• On combinatorial optimization problems on matroids with uncertain weights
• Bottleneck combinatorial optimization problems with fuzzy scenarios
• Some methods for evaluating the optimality of elements in matroids with ill-known weights

This page was built for publication: Possibilistic bottleneck combinatorial optimization problems with ill-known weights

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