Generalized Networks: The Theory of Preprocessing and an Empirical Analysis

DOI10.1287/IJOC.1030.0031zbMath1239.90012OpenAlexW2114337889MaRDI QIDQ2890417

Karen Lewis, Jeffrey L. Kennington

Publication date: 8 June 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1030.0031

zbMATH Keywords

algorithmsnetwork flowgeneralized networks\texttt{CPLEX}

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10)

Related Items (4)

Logical and inequality implications for reducing the size and difficulty of quadratic unconstrained binary optimization problems ⋮ On the use of guided design search for discovering significant decision variables in the fixed‐charge capacitated multicommodity network design problem ⋮ Quadratic unconstrained binary optimization problem preprocessing: theory and empirical analysis ⋮ Unnamed Item

Uses Software

• CPLEX

This page was built for publication: Generalized Networks: The Theory of Preprocessing and an Empirical Analysis