default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 32
Volume 32, May 2019
- Tatsuya Matsuoka, Shin-ichi Tanigawa:
On reachability mixed arborescence packing. 1-10 - Dabeen Lee
:
On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0, 1 hypercube. 11-18 - Yuma Yonebayashi:
An algorithmic approach to dual integrality of matching and extensions. 19-36 - Van Huy Pham, Kien Trung Nguyen, Tran Thu Le:
A linear time algorithm for balance vertices on trees. 37-42 - Ivo Koch, Javier Marenco:
An integer programming approach to b-coloring. 43-62 - Weige Xi, Ligong Wang:
On the signless Laplacian spectral radius of weighted digraphs. 63-72 - Steven Kelk, Georgios Stamoulis:
Integrality gaps for colorful matchings. 73-92 - Andrew J. Geyer, Dursun A. Bulutoglu, Kenneth Joseph Ryan:
Finding the symmetry group of an LP with equality constraints and its application to classifying orthogonal arrays. 93-119
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 2025-02-19 00:44 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:
