The following pages link to Minimum cuts and related problems (Q4090127):
Displaying 50 items.
- A polyhedral approach to the single row facility layout problem (Q378107) (← links)
- On duality gap in binary quadratic programming (Q454277) (← links)
- Bayesian image restoration for mosaic active imaging (Q479883) (← links)
- A polynomial-time recursive algorithm for some unconstrained quadratic optimization problems (Q643005) (← links)
- A Lagrangian decomposition approach to computing feasible solutions for quadratic binary programs (Q683935) (← links)
- Pseudo-Boolean optimization (Q697569) (← links)
- Models and methods for standardization problems (Q704119) (← links)
- Parallel branch and bound algorithms for quadratic zero-one programs on the hypercube architecture (Q757239) (← links)
- Unconstrained quadratic bivalent programming problem (Q792219) (← links)
- Mixed integer formulations using natural variables for single machine scheduling around a common due date (Q827597) (← links)
- On computing minimum\((s,t)\)-cuts in digraphs (Q835038) (← links)
- On total variation minimization and surface evolution using parametric maximum flows (Q847514) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- On the power of neural networks for solving hard problems (Q909457) (← links)
- Global optimization for first order Markov random fields with submodular priors (Q967400) (← links)
- Low-energy excitations in the three-dimensional random-field Ising model (Q978939) (← links)
- Unimodular functions (Q1079493) (← links)
- A solvable case of quadratic 0-1 programming (Q1079494) (← links)
- Quadratic functions with exponential number of local maxima (Q1079496) (← links)
- On the complexity of the maximum satisfiability problem for Horn formulas (Q1099168) (← links)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- Experiments in quadratic 0-1 programming (Q1123806) (← links)
- Implementation of parallel branch-and-bound algorithms --- experiences with the graph partitioning problem (Q1179744) (← links)
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach (Q1187840) (← links)
- A solvable class of quadratic 0-1 programming (Q1193723) (← links)
- Cliques and clustering: A combinatorial approach (Q1267180) (← links)
- Lagrangean methods for the 0-1 quadratic knapsack problem (Q1268265) (← links)
- A constrained nonlinear 0-1 program for data allocation (Q1290718) (← links)
- Simulated annealing for the unconstrained quadratic pseudo-Boolean function (Q1296801) (← links)
- Boolean polynomials and set functions (Q1310196) (← links)
- A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem (Q1356513) (← links)
- Strong formulations for quadratic optimization with M-matrices and indicator variables (Q1650773) (← links)
- Exact solution of hub network design problems with profits (Q1754057) (← links)
- The generalized vertex cover problem and some variations (Q1756348) (← links)
- Solving the fixed rank convex quadratic maximization in binary variables by a parallel zonotope construction algorithm (Q1779531) (← links)
- Lagrangean methods for 0-1 quadratic problems (Q1803678) (← links)
- An evolutionary heuristic for quadratic 0-1 programming (Q1809845) (← links)
- \(w\)-density and \(w\)-balanced property of weighted graphs (Q1847635) (← links)
- A unified approach to polynomially solvable cases of integer ``non-separable'' quadratic optimization (Q1897348) (← links)
- Minimum cuts in parametric networks (Q1905228) (← links)
- Parametric Lagrangian dual for the binary quadratic programming problem (Q2018469) (← links)
- The bipartite unconstrained 0-1 quadratic programming problem: polynomially solvable cases (Q2355744) (← links)
- Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem (Q2369979) (← links)
- Min-Max MPC based on a network problem (Q2474457) (← links)
- Star \(p\)-hub median problem with modular arc capacities (Q2475857) (← links)
- Projection results for vehicle routing (Q2583125) (← links)
- Graph separation techniques for quadratic zero-one programming (Q2638933) (← links)
- Computational aspects of a branch and bound algorithm for quadratic zero- one programming (Q2641083) (← links)
- Total Variation in Imaging (Q2789827) (← links)
- Generalized network design polyhedra (Q3100692) (← links)
