Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
type: Item
instance of: scholarly article
title: Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
zbMATH Open document ID: 1328.90131
author: Hassene Aissi
author: S. Thomas McCormick
author: Maurice Queyranne
author: A. R. Mahjoub
published in: Mathematical Programming. Series A. Series B
publication date: 2015-12-09T00:00:00Z
Mathematics Subject Classification ID: 90C29
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 6518231
zbMATH Keywords: multiobjective optimization
zbMATH Keywords: parametric optimization
zbMATH Keywords: global minimum cut
MaRDI profile type: Publication
full work available at URL: s10107-015-0944-8
OpenAlex ID: W2132147722
cites work: A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
cites work: Multicriteria global minimum cuts
cites work: Complexity of some parametric integer and network programming problems
cites work: Output-sensitive results on convex hulls, extreme points, and related problems
cites work: Minimizing symmetric submodular functions
cites work: Q4393480
cites work: Multicriteria Optimization
cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
cites work: Lower Bounds in a Parallel Model without Bit Operations
cites work: Parametric multiple sequence alignment and phylogeny construction
cites work: Q3683848
cites work: On the number of small cut in a graph
cites work: Modeling hypergraphs by graphs with the same mincut properties
cites work: Q3140397
cites work: Minimum cuts in near-linear time
cites work: Q4633832
cites work: A new approach to the minimum cut problem
cites work: Sketching Cuts in Graphs and Hypergraphs
cites work: A Procedure for Computing the K Best Solutions to Discrete Optimization Problems and Its Application to the Shortest Path Problem
cites work: Cutsets and partitions of hypergraphs
cites work: A fast hypergraph min-cut algorithm for circuit partitioning
cites work: Q3134498
cites work: Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
cites work: Computing Edge-Connectivity in Multigraphs and Capacitated Graphs
cites work: Algorithmic Aspects of Graph Connectivity
cites work: Computing All Small Cuts in an Undirected Network
cites work: Q3694703
cites work: Q4221106
cites work: The upper bound theorem for polytopes: An easy proof of its asymptotic version
cites work: A simple min-cut algorithm
cites work: Suboptimal cuts: Their enumeration, weight and number
cites work: Slicing Space
DOI: 10.1007/S10107-015-0944-8
description: scientific article; zbMATH DE number 6518231