# Items where Subject is "90-XX Operations research, mathematical programming > 90Cxx Mathematical programming > 90C11 Mixed integer programming"

Up a level |

- MSC Classification Numbers (22)
- 90-XX Operations research, mathematical programming (22)
- 90Cxx Mathematical programming (22)
**90C11 Mixed integer programming**(22)

- 90Cxx Mathematical programming (22)

- 90-XX Operations research, mathematical programming (22)

**22**.

## A

Althaus, Ernst and Bockmayr, Alexander and Elf, Matthias and Kasper, Thomas and Jünger, Michael and Mehlhorn, Kurt
(2002)
*SCIL - Symbolic Constraints in Integer Linear Programming.*
**Published In:**
Algorithms - ESA 2002 : 10th annual European symposium, Rome, Italy, September 17 - 21, 2002 ; proceedings, Lecture notes in computer science. 2461 Springer 2002, pp. 75-87.

## B

Bachem, Achim and Johnson, Ellis L. and Schrader, Rainer
(1982)
*A characterization of minimal inequalities for mixed integer programs.*
**Published in: **
Operations Research Letters Vol. 1 (2).
pp. 63-66.

Bachem, Achim and Schrader, Rainer
(1980)
*Minimal inequalities and subadditive duality.*
**Published in: **
SIAM Journal on Control and Optimization Vol. 18 (4).
pp. 437-443.
ISSN 0363-0129

Bachem, Achim and Schrader, Rainer
(1979)
*A duality theorem and minimal inequalities in mixed integer programming.*
**Published in: **
Zeitschrift für Angewandte Mathematik und Mechanik (ZAMM) Vol. 59.
pp. 88-89.

## C

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R.
(2014)
*Single-Commodity Robust Network Design with Finite and Hose Demand Sets.*

Technical Report
, 32 p.

Cacchiani, Valentina and Jünger, Michael and Liers, Frauke and Lodi, Andrea and Schmidt, Daniel R.
(2016)
*Single-commodity robust network design with finite and Hose demand sets.*
**Published in: **
Mathematical Programming Vol. 157 (1).
pp. 297-342.
ISSN 0025-5610

## J

Jabrayilov, Adalat and Mallach, Sven and Mutzel, Petra and Rüegg, Ulf and von Hanxleden, Reinhard
(2016)
*Compact Layered Drawings of General Directed Graphs.*
**Published In:**
Graph Drawing and Network Visualization: 24th International Symposium, GD 2016, Athens, Greece, September 19-21, 2016, Revised Selected Papers, Lecture Notes in Computer Science. 9801 Springer 2016, pp. 209-221.

Jünger, Michael and Reinelt, Gerhard and Thienel, Stefan
(1995)
*Practical Problem Solving with cutting Plane Algorithms in Combinatorial Optimization.*
**Published in:**
Practical Problem Solving with cutting Plane Algorithms in Combinatorial Optimization., DIMACS Series in Discrete Mathematics and Theoretical Computer Sciences. American Mathematical Society 1995, pp. 111-152.

## M

Mallach, Sven
(2018)
*Compact Linearization for Binary Quadratic Problems Comprising Linear Constraints.*

Technical Report
, 16 p.

Mallach, Sven
(2017)
*Compact Linearization for Binary Quadratic Problems subject to Linear Equations.*

Technical Report
, 10 p.

Mallach, Sven
(2017)
*Compact linearization for binary quadratic problems subject to assignment constraints.*
**Published in: **
4OR : Quarterly Journal of Operations Research.
pp. 1-14.
ISSN 1614-2411

Mallach, Sven
(2017)
*Improved mixed-integer programming models for the multiprocessor scheduling problem with communication delays.*
**Published in: **
Journal of Combinatorial Optimization.
pp. 1-22.
ISSN 1573-2886

Mallach, Sven
(2021)
*Inductive Linearization for Binary Quadratic Programs with
Linear Constraints: A Computational Study.*

Technical Report
Springer, 30 p.

Mallach, Sven
(2020)
*Inductive linearization for binary quadratic programs with
linear constraints.*
**Published in: **
4OR : Quarterly Journal of Operations Research.
pp. 1-23.

Mallach, Sven
(2017)
*Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.*
**Published In:**
Combinatorial Algorithms : 28th International Workshop, IWOCA 2017, Newcastle, NSW, Australia, July 17-21, 2017, Revised Selected Papers, Lecture Notes in Computer Science. 10765 Springer 2017, pp. 327-340.

Mallach, Sven
(2018)
*Linear Ordering Based MIP Formulations for the Vertex Separation or Pathwidth Problem.*
**Published in: **
Journal of Discrete Algorithms.

Mallach, Sven
(2019)
*A Natural Quadratic Approach to the Generalized Graph Layering Problem.*
**Published In:**
Graph Drawing and Network Visualization: 27th International Symposium, GD 2019, Prague, Czech Republic, September 17–20, 2019, Proceedings, Lecture Notes in Computer Science. 11904 Springer 12 August 2019, pp. 532-544.

Mallach, Sven
(2015)
*A practical mixed-integer programming model for
the vertex separation number problem.*

Working Paper
, 8 p.

## T

Thienel, Stefan
(1996)
*ABACUS - A Branch-And-CUt System, Version 1.2, User's Guide and Reference Manual.*

Technical Report
p.

Thienel, Stefan
(1997)
*ABACUS - A Branch-And-CUt System, Version 2.0, User's Guide and Reference Manual.*

Manual
, 350 p.

Thienel, Stefan
(1996)
*A Simple TSP-Solver: An ABACUS Tutorial.*

Technical Report
, 34 p.

Thienel, Stefan and Jünger, Michael
(1997)
*The Design of the Branch-and-Cut System ABACUS.*

Technical Report
, 30 p.