default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 240
Volume 240, May 2018
- Antoine Deza, Frédéric Meunier:
Preface: Linear optimization. 1-2 - Michele Barbato
, Roland Grappe, Mathieu Lacroix, Clément Pira:
Lexicographical polytopes. 3-7 - Steffen Borgwardt, Jesús A. De Loera, Elisabeth Finhold, Jacob Miller:
The hierarchy of circuit diameters and transportation polytopes. 8-24 - Norbert Bus, Nabil H. Mustafa, Saurabh Ray:
Practical and efficient algorithms for the geometric hitting set problem. 25-32 - Denis Cornaz, Hervé Kerivin, Ali Ridha Mahjoub:
Minimal arc-sets spanning dicycles. 33-43 - Bala Krishnamoorthy, Gavin W. Smith:
Non total-unimodularity neutralized simplicial complexes. 44-62 - Jon Lee, Daphne E. Skipper:
Computing with an algebraic-perturbation variant of Barvinok's algorithm. 63-77 - Frédéric Meunier, Pauline Sarrabezolles:
Colorful linear programming, Nash equilibrium, and pivots. 78-91 - Javad Tayyebi, Massoud Aman:
On inverse linear programming problems under the bottleneck-type weighted Hamming distance. 92-101
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
