Minimum cuts and related problems
From MaRDI portal
Publication:4090127
DOI10.1002/NET.3230050405zbMath0325.90047OpenAlexW2028576516MaRDI QIDQ4090127
Jean-Claude Picard, H. Donald Ratliff
Publication date: 1975
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230050405
Programming involving graphs or networks (90C35) Integer programming (90C10) Nonlinear programming (90C30) Deterministic network models in operations research (90B10)
Related Items (62)
Unimodular functions ⋮ A solvable case of quadratic 0-1 programming ⋮ Quadratic functions with exponential number of local maxima ⋮ Mixed integer formulations using natural variables for single machine scheduling around a common due date ⋮ Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem ⋮ On computing minimum\((s,t)\)-cuts in digraphs ⋮ Complexity and Polynomially Solvable Special Cases of QUBO ⋮ Recent developments in maximum flow algorithms ⋮ On total variation minimization and surface evolution using parametric maximum flows ⋮ On the complexity of the maximum satisfiability problem for Horn formulas ⋮ A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization ⋮ Graph separation techniques for quadratic zero-one programming ⋮ A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem ⋮ Computational aspects of a branch and bound algorithm for quadratic zero- one programming ⋮ Strong formulations for quadratic optimization with M-matrices and indicator variables ⋮ Minimum cuts in parametric networks ⋮ The quadratic knapsack problem -- a survey ⋮ The Boolean quadratic polytope: Some characteristics, facets and relatives ⋮ Experiments in quadratic 0-1 programming ⋮ A polyhedral approach to the single row facility layout problem ⋮ Optimal hierarchical clustering on a graph ⋮ The rotation distance of brooms ⋮ On the power of neural networks for solving hard problems ⋮ Bounds for Random Binary Quadratic Programs ⋮ A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems ⋮ On duality gap in binary quadratic programming ⋮ Bayesian image restoration for mosaic active imaging ⋮ Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem ⋮ Continuous limits of discrete perimeters ⋮ Anomalous finite size corrections in random field models ⋮ Unconstrained 0-1 nonlinear programming: A nondifferentiable approach ⋮ A solvable class of quadratic 0-1 programming ⋮ Fractional covers for forests and matchings ⋮ A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs ⋮ Min-Max MPC based on a network problem ⋮ Star \(p\)-hub median problem with modular arc capacities ⋮ Exact solution of hub network design problems with profits ⋮ The generalized vertex cover problem and some variations ⋮ Global optimization for first order Markov random fields with submodular priors ⋮ Pseudo-Boolean optimization ⋮ An introduction to continuous optimization for imaging ⋮ Models and methods for standardization problems ⋮ Low-energy excitations in the three-dimensional random-field Ising model ⋮ Parametric Lagrangian dual for the binary quadratic programming problem ⋮ A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems ⋮ Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm ⋮ Total Variation in Imaging ⋮ Cut Pursuit: Fast Algorithms to Learn Piecewise Constant Functions on General Weighted Graphs ⋮ Global equilibrium search applied to the unconstrained binary quadratic optimization problem ⋮ Lagrangean methods for 0-1 quadratic problems ⋮ An evolutionary heuristic for quadratic 0-1 programming ⋮ Cliques and clustering: A combinatorial approach ⋮ Lagrangean methods for the 0-1 quadratic knapsack problem ⋮ Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture ⋮ Generalized network design polyhedra ⋮ A constrained nonlinear 0-1 program for data allocation ⋮ Simulated annealing for the unconstrained quadratic pseudo-Boolean function ⋮ \(w\)-density and \(w\)-balanced property of weighted graphs ⋮ Unconstrained quadratic bivalent programming problem ⋮ Boolean polynomials and set functions ⋮ Projection results for vehicle routing ⋮ The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
Cites Work
This page was built for publication: Minimum cuts and related problems
