Minimum cuts and related problems
From MaRDI portal
Cites work
Cited in
(65)- Unimodular functions
- A solvable case of quadratic 0-1 programming
- Quadratic functions with exponential number of local maxima
- On the complexity of the maximum satisfiability problem for Horn formulas
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
- A solvable class of quadratic 0-1 programming
- Cliques and clustering: A combinatorial approach
- Lagrangean methods for the 0-1 quadratic knapsack problem
- A constrained nonlinear 0-1 program for data allocation
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- Boolean polynomials and set functions
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Exact solution of hub network design problems with profits
- The generalized vertex cover problem and some variations
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- Lagrangean methods for 0-1 quadratic problems
- An evolutionary heuristic for quadratic 0-1 programming
- \(w\)-density and \(w\)-balanced property of weighted graphs
- A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
- Minimum cuts in parametric networks
- Parametric Lagrangian dual for the binary quadratic programming problem
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem
- Min-Max MPC based on a network problem
- Star p-hub median problem with modular arc capacities
- Projection results for vehicle routing
- Graph separation techniques for quadratic zero-one programming
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming
- Total Variation in Imaging
- Generalized network design polyhedra
- Anomalous finite size corrections in random field models
- Fractional covers for forests and matchings
- Continuous limits of discrete perimeters
- A polyhedral approach to the single row facility layout problem
- On duality gap in binary quadratic programming
- Bounds for random binary quadratic programs
- Cut pursuit: fast algorithms to learn piecewise constant functions on general weighted graphs
- Bayesian image restoration for mosaic active imaging
- Complexity and polynomially solvable special cases of QUBO
- Recent developments in maximum flow algorithms
- A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- An introduction to continuous optimization for imaging
- Optimal hierarchical clustering on a graph
- The rotation distance of brooms
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs
- Message recovery attack in NTRU through VFK lattices
- Conditional gradients for total variation regularization with PDE constraints: a graph cuts approach
- Approximation algorithm for extracting densest subgraph over matching-like constraints
- Pseudo-Boolean optimization
- 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
- Mixed integer formulations using natural variables for single machine scheduling around a common due date
- On computing minimum(s,t)-cuts in digraphs
- On total variation minimization and surface evolution using parametric maximum flows
- The quadratic knapsack problem -- a survey
- On the power of neural networks for solving hard problems
- Global optimization for first order Markov random fields with submodular priors
- Low-energy excitations in the three-dimensional random-field Ising model
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)
