scientific article
From MaRDI portal
Publication:3094163
zbMath1226.90003MaRDI QIDQ3094163
Publication date: 21 October 2011
Full work available at URL: http://archiv.ub.uni-heidelberg.de/volltextserver/volltexte/2011/12289/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Abstract computational complexity for mathematical programming problems (90C60) Graph theory (including graph drawing) in computer science (68R10) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items (2)
Exact solution of the 2-dimensional grid arrangement problem ⋮ Linear size MIP formulation of max-cut: new properties, links with cycle inequalities and computational results
Uses Software
This page was built for publication:
