default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 50
Volume 50, November 2023
- Ali Erdem Banak, Tínaz Ekim, Z. Caner Taskin:
Constructing extremal triangle-free graphs using integer programming. 100802 - Leah Epstein
:
More on online weighted edge coloring. 100803 - Rui Chen, Sanjeeb Dash, Oktay Günlük:
Convexifying multilinear sets with cardinality constraints: Structural properties, nested case and extensions. 100804 - Haoran Zhu:
The k-aggregation closure for covering sets. 100805 - K. Subramani, Piotr Wojciechowski:
Optimal length cutting plane refutations of integer programs. 100806 - Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos:
On cut polytopes and graph minors. 100807 - Chaohui Chen, Wenshui Lin:
On the general Z-type index of connected graphs. 100808 - Shunhai He, Huiqing Liu:
The maximum number of short paths in a Halin graph. 100809 - Patrick Chervet, Roland Grappe, Mathieu Lacroix, Francesco Pisanu, Roberto Wolfler Calvo:
Hard problems on box-totally dual integral polyhedra. 100810 - Zoltán Szigeti:
Packing mixed hyperarborescences. 100811
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-03-05 20:53 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:
