Some Network Flow Problems Solved with Pseudo-Boolean Programming
From MaRDI portal
Publication:5341344
Recommendations
Cited in
(58)- A solvable case of quadratic 0-1 programming
- The Boolean quadratic polytope: Some characteristics, facets and relatives
- Experiments in quadratic 0-1 programming
- The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds
- Facets for the cut cone. I
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function
- Some thoughts on combinatorial optimisation
- On a general framework for network representability in discrete optimization
- Strong formulations for quadratic optimization with M-matrices and indicator variables
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm
- An evolutionary heuristic for quadratic 0-1 programming
- The cut polytope and the Boolean quadric polytope
- Modelling competitive Hopfield networks for the maximum clique problem
- Application of cut polyhedra. I
- A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming
- Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
- Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings
- The basic algorithm for pseudo-Boolean programming revisited
- A binarisation heuristic for non-convex quadratic programming with box constraints
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases
- Generating facets for the cut polytope of a graph by triangular elimination
- Constrained 0-1 quadratic programming: basic approaches and extensions
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization
- Recent Progress in Interior-Point Methods: Cutting-Plane Algorithms and Warm Starts
- Computational approaches to MAX-cut
- Global approaches for facility layout and VLSI floorplanning
- From Graph Orientation to the Unweighted Maximum Cut
- On a general framework for network representability in discrete optimization (extended abstract)
- Some experiences with solving semidefinite programming relaxations of binary quadratic optimization models in computational biology
- Crossing Minimization in Storyline Visualization
- Optimal allocation in combinatorial auctions with quadratic utility functions
- The Expressive Power of Binary Submodular Functions
- scientific article; zbMATH DE number 3860887 (Why is no real title available?)
- scientific article; zbMATH DE number 3878668 (Why is no real title available?)
- A computational study and survey of methods for the single-row facility layout problem
- scientific article; zbMATH DE number 1107784 (Why is no real title available?)
- scientific article; zbMATH DE number 2084706 (Why is no real title available?)
- Tight cycle relaxations for the cut polytope
- Efficient minimization of higher order submodular functions using monotonic Boolean functions
- Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization
- What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO
- A polynomial algorithm for a class of 0-1 fractional programming problems involving composite functions, with an application to additive clustering
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
- Inductive linearization for binary quadratic programs with linear constraints
- Classes of submodular constraints expressible by graph cuts
- Graph partitioning: an updated survey
- 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
- Multi-view ensemble feature selection via semidefinite programming
- Canonical dual approach to solving the maximum cut problem
- Pseudo-Boolean optimization
- A family of spanning-tree formulations for the maximum cut problem
- On finding the K best cuts in a network
- The binary network flow problem is logspace complete for P
- The expressive power of binary submodular functions
- Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems
This page was built for publication: Some Network Flow Problems Solved with Pseudo-Boolean Programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5341344)
