Structural and algorithmic properties for parametric minimum cuts
type: Item
instance of: scholarly article
title: Structural and algorithmic properties for parametric minimum cuts
zbMATH Open document ID: 1269.90126
author: Frieda Granot
author: S. Thomas McCormick
author: Fabio Tardella
author: Maurice Queyranne
published in: Mathematical Programming. Series A. Series B
publication date: 2012-10-15T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C31
zbMATH DE Number: 6093773
zbMATH Keywords: submodularity
zbMATH Keywords: minimum cut/maximum flow
zbMATH Keywords: parametric optimization
zbMATH Keywords: nested solutions
zbMATH Keywords: comparative statics
MaRDI profile type: Publication
full work available at URL: s10107-011-0463-1
OpenAlex ID: W1999966159
cites work: Q3056948
cites work: Improved Algorithms for Bipartite Network Flow
cites work: Generalization of a theorem on the parametric maximum flow problem
cites work: Q4845373
cites work: Ordered optimal solutions and parametric minimum cut problems
cites work: Complexity of some parametric integer and network programming problems
cites work: Q5624995
cites work: On Nonlinear Fractional Programming
cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
cites work: Universally maximum flow with piecewise-constant capacities
cites work: A push-relabel framework for submodular function minimization and applications to parametric optimization
cites work: Q3292914
cites work: Lexicographically Optimal Base of a Polymatroid with Respect to a Weight Vector
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
cites work: A new approach to the maximum-flow problem
cites work: A fast algorithm for the generalized parametric minimum cut problem and applications
cites work: A faster parametric minimum-cut algorithm
cites work: Algorithms – ESA 2005
cites work: The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
cites work: Q5734003
cites work: Q4058442
cites work: A Faster Deterministic Maximum Flow Algorithm
cites work: A comparison of phase and nonphase network flow algorithms
cites work: Fast Algorithms for Parametric Scheduling Come From Extensions to Parametric Maximum Flow
cites work: Computing maximum mean cuts
cites work: Monotone Comparative Statics
cites work: On Convex Minimization over Base Polytopes
cites work: Minimum-delay routing in continuous-time dynamic networks with Piecewise-constant capacities
cites work: Q3291034
cites work: A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
cites work: Selected Applications of Minimum Cuts in Networks
cites work: Parametric flows, weighted means of cuts, and fractional combinatorial optimization
cites work: A Selection Problem of Shared Fixed Costs and Network Flows
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: A note on the parametric maximum flow problem and some related reoptimization issues
cites work: On network flow functions
cites work: Critical Load Factors in Two-Processor Distributed Systems
cites work: A simple version of Karzanov's blocking flow algorithm
cites work: Minimizing a Submodular Function on a Lattice
DOI: 10.1007/S10107-011-0463-1
description: scientific article; zbMATH DE number 6093773