Selected Applications of Minimum Cuts in Networks
applications of minimum cutsbinary quadratic programming formulationcombinatorial optimizationdirected graphgraph theorylocation theorymaximum weightnetwork problemsschedulingsequencing
Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Inventory, storage, reservoirs (90B05) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Programming involving graphs or networks (90C35) Applications of mathematical programming (90C90)
- Testing membership in matroid polyhedra
- The poset scheduling problem
- On the efficiency of maximum-flow algorithms on networks with small integer capacities
- The planar multiterminal cut problem
- The complexity of controlled selection
- Using separation algorithms to generate mixed integer model reformulations
- Transitions in geometric minimum spanning trees
- Polyhedral results for the precedence-constrained knapsack problem
- Extracting maximal information about sets of minimum cuts
- Minimizing a submodular function arising from a concave function
- Maximal closure on a graph with resource constraints
- Improving graph partitions using submodular functions.
- Structure of a simple scheduling polyhedron
- A unified approach to polynomially solvable cases of integer ``non-separable quadratic optimization
- A new unifying heuristic algorithm for the undirected minimum cut problems using minimum range cut algorithms
- Polynomial-time algorithms for submodular Laplacian systems
- Polynomial time algorithm for an optimal stable assignment with multiple partners
- Separation of partition inequalities with terminals
- Network reinforcement
- Graphic submodular function minimization: a graphic approach and applications
- Fractional covers for forests and matchings
- The \textsc{max quasi-independent set} problem
- Complexity and polynomially solvable special cases of QUBO
- Logical s-t Min-Cut Problem: An Extension to the Classic s-t Min-Cut Problem
- Clique-connecting forest and stable set polytopes
- Quantum Speedup for Graph Sparsification, Cut Approximation, and Laplacian Solving
- Two‐stage stochastic minimum s − t cut problems: Formulations, complexity and decomposition algorithms
- Speedup the optimization of maximal closure of a node-weighted directed acyclic graph
- The rotation distance of brooms
- Structural and algorithmic properties for parametric minimum cuts
- An efficient algorithm for the minimum capacity cut problem
- A unified approach to finding good stable matchings in the hospitals/residents setting
This page was built for publication: Selected Applications of Minimum Cuts in Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3967364)
