scientific article

From MaRDI portal

Publication:2928706

Jump to:navigation, search

zbMath1326.90053MaRDI QIDQ2928706

Sanjeeb Dash

Publication date: 10 November 2014

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integer programming cutting planes proof complexity group polyhedra subadditive inequalities

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Related Items (1)

Theoretical challenges towards cutting-plane selection

Uses Software

MIPLIB

This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2928706&oldid=15905327"