Robust optimization of graph partitioning involving interval uncertainty
type: Item
instance of: scholarly article
title: Robust optimization of graph partitioning involving interval uncertainty
zbMATH Open document ID: 1245.05101
author: Neng Fan
author: Panos M. Pardalos
author: Qipeng P. Zheng
published in: Theoretical Computer Science
publication date: 2012-08-13T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6065018
zbMATH Keywords: graph partitioning
zbMATH Keywords: robust optimization
zbMATH Keywords: uncertainty
zbMATH Keywords: bipartite graph partitioning
zbMATH Keywords: Benders decomposition
Wikidata QID: Q57734132
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: j.tcs.2011.10.015
OpenAlex ID: W2045321028
cites work: Robust discrete optimization and network flows
cites work: The Price of Robustness
cites work: Linear and quadratic programming approaches for the general graph partitioning problem
cites work: Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs
cites work: Robust Optimization of Graph Partitioning and Critical Node Detection in Analyzing Networks
cites work: Some simplified NP-complete graph problems
cites work: Multiset graph partitioning
cites work: Q4400639
cites work: Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
cites work: Graph partitioning using linear and semidefinite programming
cites work: An exact algorithm for the robust shortest path problem with interval data
cites work: Technical Note—Convex Programming with Set-Inclusive Constraints and Applications to Inexact Linear Programming
cites work: Semidefinite programming relaxations for the graph partitioning problem
cites work: The robust spanning tree problem with interval data
DOI: 10.1016/J.TCS.2011.10.015
description: scientific article; zbMATH DE number 6065018