A general approach to the calculation of stability radii for the max-cut problem with multiple criteria

DOI10.1134/S1990478915040092zbMath1349.90817OpenAlexW2276512150MaRDI QIDQ3186842

Kirill G. Kuzmin

Publication date: 12 August 2016

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478915040092

zbMATH Keywords

stability radiusintractabilityPareto setgraph cutmultiobjective problemHölder metric

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29)

Related Items (5)

On the quasistability radius for a multicriteria integer linear programming problem of finding extremum solutions ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ Stability Analysis for Pricing ⋮ Stability Aspects of Multicriteria Integer Linear Programming Problems ⋮ Estimating the Stability Radius of an Optimal Solution to the Simple Assembly Line Balancing Problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Different types of stability of vector integer optimization problem: General approach
• On the complexity of postoptimality analysis of \(0/1\) programs
• Calculation of stability radii for combinatorial optimization problems
• On the calculation of stability radius for multi-objective combinatorial optimization problems by inverse optimization
• Quantitative stability analysis for vector problems of 0-1 programming
• On the practically interesting instances of MAXCUT
• Optimization and optimality test for the Max-Cut Problem
• Estimating the stability radius of the vector MAX-CUT problem

This page was built for publication: A general approach to the calculation of stability radii for the max-cut problem with multiple criteria