Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization
From MaRDI portal
Publication:2046309
DOI10.1007/s10898-021-01012-3OpenAlexW3145682784MaRDI QIDQ2046309
Publication date: 17 August 2021
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10898-021-01012-3
Cites Work
- Unnamed Item
- Some transformation techniques with applications in global optimization
- Valid inequalities for mixed 0-1 programs
- Facets of the independent set polytope
- Finding all solutions of nonlinearly constrained systems of equations
- Solving a Truck Dispatching Scheduling Problem Using Branch-and-Cut
- Solving Large-Scale Zero-One Linear Programming Problems
- Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
- The mixed vertex packing problem.
This page was built for publication: Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization
