Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
type: Item
instance of: scholarly article
title: Solving a cut problem in bipartite graphs by linear programming: application to a forest management problem
zbMATH Open document ID: 1185.90148
author: Alain Billionnet
published in: Applied Mathematical Modelling
publication date: 2010-05-06T00:00:00Z
Mathematics Subject Classification ID: 90C05
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 92D40
Mathematics Subject Classification ID: 91B76
zbMATH DE Number: 5705010
zbMATH Keywords: bipartite graph
zbMATH Keywords: cut
zbMATH Keywords: linear programming
zbMATH Keywords: land allocation modelling
zbMATH Keywords: wildlife habitat
zbMATH Keywords: experiments
describes a project that uses: AMPL
describes a project that uses: CPLEX
describes a project that uses: Biq Mac
MaRDI profile type: Publication
full work available at URL: j.apm.2009.07.014
OpenAlex ID: W2046294155
cites work: Handbook of operations research in natural resources. With the collaboration of Jaime Miranda
cites work: Q4039988
cites work: Q3992496
cites work: Q4054818
cites work: Q4142699
cites work: Some simplified NP-complete graph problems
cites work: Q4198056
cites work: Node-and edge-deletion NP-complete problems
cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
cites work: Q5659589
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
cites work: Weakly bipartite graphs and the max-cut problem
cites work: The max-cut problem on graphs not contractible to \(K_ 5\)
cites work: Q4942616
cites work: Pseudo-Boolean optimization
cites work: Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
cites work: Q4040221
cites work: Q3815146
DOI: 10.1016/J.APM.2009.07.014
description: scientific article; zbMATH DE number 5705010