Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
type: Item
instance of: scholarly article
title: Algorithmic and modeling insights via volumetric comparison of polyhedral relaxations
zbMATH Open document ID: 1394.52011
author: Jon Lee
author: Emily Speakman
author: Daphne Skipper
published in: Mathematical Programming. Series A. Series B
publication date: 2018-07-13T00:00:00Z
Mathematics Subject Classification ID: 52B11
Mathematics Subject Classification ID: 52B12
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 52A38
zbMATH DE Number: 6903334
zbMATH Keywords: polytope
zbMATH Keywords: volume
zbMATH Keywords: global optimization
zbMATH Keywords: mixed-integer nonlinear optimization
zbMATH Keywords: fixed charge
zbMATH Keywords: facility location
zbMATH Keywords: vertex packing
zbMATH Keywords: Boolean quadric
zbMATH Keywords: monomial
zbMATH Keywords: spatial branch-and-bound
describes a project that uses: Sostools
describes a project that uses: ANTIGONE
describes a project that uses: SCIP
describes a project that uses: Bonmin
MaRDI profile type: Publication
full work available at URL: s10107-018-1272-6
OpenAlex ID: W2798091936
cites work: Branching and bounds tighteningtechniques for non-convex MINLP
cites work: Principles of combinatorics
cites work: Parametric nonlinear discrete optimization over well-described sets and matroid intersections
cites work: An algorithmic framework for convex mixed integer nonlinear programs
cites work: Counting linear extensions
cites work: On convex relaxations of quadrilinear terms
cites work: Integer Polynomial Optimization in Fixed Dimension
cites work: The cut polytope and the Boolean quadric polytope
cites work: Correlation polytopes: Their geometry and complexity
cites work: An enumeration of simplicial 4-polytopes with 8 vertices
cites work: There Cannot be any Algorithm for Integer Programming with Quadratic Constraints
cites work: The volume of relaxed Boolean-quadric and cut polytopes
cites work: Polytope Volume Computation
cites work: Geometric comparison of combinatorial polytopes
cites work: All-different polytopes
cites work: Separating type-I odd-cycle inequalities for a binary-encoded edge-coloring formulation
cites work: Threshold graphs and related topics
cites work: ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
cites work: Nonlinear discrete optimization. An algorithmic theory
cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives
cites work: Experimental validation of volume-based comparison for double-McCormick relaxations
cites work: Quantifying Double McCormick
cites work: Q3225387
cites work: Two poset polytopes
cites work: A decomposition of 2-weak vertex-packing polytopes
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
cites work: SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework
Wikidata QID: Q129998051
DOI: 10.1007/S10107-018-1272-6
description: scientific article; zbMATH DE number 6903334