Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization

Andriy Shapoval () and Eva K. Lee ()
Additional contact information
Andriy Shapoval: Georgia Institute of Technology
Eva K. Lee: Georgia Institute of Technology

Journal of Global Optimization, 2021, vol. 80, issue 4, No 4, 805-840

Abstract: Abstract This work starts a new level of research in the area of conflict graphs and hypergraphs. We introduce a new term “mixed conflict hypergraphs”, which comes from merging and generalizing 0-1 conflict hypergraphs and mixed conflict graphs. Two structured mixed integer problems (referred to as convexification of posynomial and signomial functions, CoPF and CoSF, respectively) are solved efficiently with applying new strong cutting planes, outperforming modern commercial software.

Keywords: Conflict graphs and hypergraphs; Convexification; Polyhedral analysis (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10898-021-01012-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:80:y:2021:i:4:d:10.1007_s10898-021-01012-3

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-021-01012-3

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().