Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
From MaRDI portal
Publication:969344
DOI10.1016/j.apm.2009.07.014zbMath1185.90148OpenAlexW2046294155MaRDI QIDQ969344
Publication date: 6 May 2010
Published in: Applied Mathematical Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.apm.2009.07.014
Linear programming (90C05) Combinatorial optimization (90C27) Environmental economics (natural resource models, harvesting, pollution, etc.) (91B76) Ecology (92D40) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (6)
Complexity and Polynomially Solvable Special Cases of QUBO ⋮ The Bipartite QUBO ⋮ Nonnegative partial \(s\)-goodness for the equivalence of a 0-1 linear program to weighted linear programming ⋮ Finding the maximum cut by the greedy algorithm ⋮ Fuel treatment planning: fragmenting high fuel load areas while maintaining availability and connectivity of faunal habitat ⋮ Mathematical optimization ideas for biodiversity conservation
Uses Software
Cites Work
- The max-cut problem on graphs not contractible to \(K_ 5\)
- Pseudo-Boolean optimization
- Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
- Weakly bipartite graphs and the max-cut problem
- Some simplified NP-complete graph problems
- Handbook of operations research in natural resources. With the collaboration of Jaime Miranda
- Finding a Maximum Cut of a Planar Graph in Polynomial Time
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Node-and edge-deletion NP-complete problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
