| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Colorful linear programming, Nash equilibrium, and pivots
|
Meunier, Frédéric
|
|
2018
|
240 |
C |
p. 78-91
|
article
|
| 2 |
Computing with an algebraic-perturbation variant of Barvinok’s algorithm
|
Lee, Jon
|
|
2018
|
240 |
C |
p. 63-77
|
article
|
| 3 |
Editorial Board
|
|
|
2018
|
240 |
C |
p. ii
|
article
|
| 4 |
Lexicographical polytopes
|
Barbato, Michele
|
|
2018
|
240 |
C |
p. 3-7
|
article
|
| 5 |
Minimal arc-sets spanning dicycles
|
Cornaz, D.
|
|
2018
|
240 |
C |
p. 33-43
|
article
|
| 6 |
Non total-unimodularity neutralized simplicial complexes
|
Krishnamoorthy, Bala
|
|
2018
|
240 |
C |
p. 44-62
|
article
|
| 7 |
On inverse linear programming problems under the bottleneck-type weighted Hamming distance
|
Tayyebi, Javad
|
|
2018
|
240 |
C |
p. 92-101
|
article
|
| 8 |
Practical and efficient algorithms for the geometric hitting set problem
|
Bus, Norbert
|
|
2018
|
240 |
C |
p. 25-32
|
article
|
| 9 |
Preface: Linear optimization
|
Deza, Antoine
|
|
2018
|
240 |
C |
p. 1-2
|
article
|
| 10 |
The hierarchy of circuit diameters and transportation polytopes
|
Borgwardt, S.
|
|
2018
|
240 |
C |
p. 8-24
|
article
|
Journal description