scientific article; zbMATH DE number 7200856

zbMath1443.90296MaRDI QIDQ5109886

Ana Klobučar, Robert Manger

Publication date: 14 May 2020

Full work available at URL: https://hrcak.srce.hr/235541

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

independent setweighted graphrobust optimizationvertex cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Signed and weighted graphs (05C22) Robustness in mathematical programming (90C17)

Uses Software

• CPLEX

Cites Work

• Unnamed Item
• Unnamed Item
• Graphs, networks and algorithms.
• Min-max and min-max regret versions of combinatorial optimization problems: A survey
• Approximation algorithms for the weighted independent set problem in sparse graphs
• Robust discrete optimization and its applications
• A note on greedy algorithms for the maximum weighted independent set problem
• Complexity of the robust weighted independent set problems on interval graphs
• Robust maximum weighted independent-set problems on interval graphs
• Genetic algorithmic approach to find the maximum weight independent set of a graph
• Handbook of Graph Theory
• Theory and Applications of Robust Optimization
• Multi-Objective Optimization Problems
• Independent Sets of Maximum Weight in Apple-Free Graphs
• Combinatorial optimization. Theory and algorithms.