Some Network Flow Problems Solved with Pseudo-Boolean Programming
From MaRDI portal
Publication:5341344
DOI10.1287/opre.13.3.388zbMath0132.13804OpenAlexW2118825986MaRDI QIDQ5341344
Publication date: 1965
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: http://www.jstor.org/pss/167803
Related Items
A solvable case of quadratic 0-1 programming, On a general framework for network representability in discrete optimization, Application of cut polyhedra. I, A heuristic-based branch and bound algorithm for unconstrained quadratic zero-one programming, The Expressive Power of Binary Submodular Functions, Speeding up IP-based algorithms for constrained quadratic 0-1 optimization, Strong formulations for quadratic optimization with M-matrices and indicator variables, A computational study and survey of methods for the single-row facility layout problem, SOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGY, Exact Facetial Odd-Cycle Separation for Maximum Cut and Binary Quadratic Optimization, The Boolean quadratic polytope: Some characteristics, facets and relatives, Experiments in quadratic 0-1 programming, Classes of submodular constraints expressible by graph cuts, Some thoughts on combinatorial optimisation, Inductive linearization for binary quadratic programs with linear constraints, Graph partitioning: an updated survey, Directed acyclic graph continuous max-flow image segmentation for unconstrained label orderings, Crossing Minimization in Storyline Visualization, The rotation distance of brooms, A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems, What Works Best When? A Systematic Evaluation of Heuristics for Max-Cut and QUBO, The max-cut problem and quadratic 0-1 optimization; polyhedral aspects, relaxations and bounds, Generating facets for the cut polytope of a graph by triangular elimination, Constrained 0-1 quadratic programming: basic approaches and extensions, Optimal Allocation in Combinatorial Auctions with Quadratic Utility Functions, Efficient minimization of higher order submodular functions using monotonic Boolean functions, A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs, Facets for the cut cone. I, Canonical dual approach to solving the maximum cut problem, The expressive power of binary submodular functions, Pseudo-Boolean optimization, Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem, Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm, Spectral bounds for unconstrained \((- 1,1)\)-quadratic optimization problems, 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, Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results, A binarisation heuristic for non-convex quadratic programming with box constraints, An evolutionary heuristic for quadratic 0-1 programming, From Graph Orientation to the Unweighted Maximum Cut, The cut polytope and the Boolean quadric polytope, On a General Framework for Network Representability in Discrete Optimization, Solving quadratic (0,1)-problems by semidefinite programs and cutting planes, Simulated annealing for the unconstrained quadratic pseudo-Boolean function, On finding the K best cuts in a network, Tight Cycle Relaxations for the Cut Polytope, A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering, The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases, Modelling competitive Hopfield networks for the maximum clique problem
