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