default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 54
Volume 54, 2024
- Victoria Kaial
, Hervé Kerivin, Annegret Katrin Wagler:
On non-superperfection of edge intersection graphs of paths. 100857 - Abraham P. Punnen, Navpreet Kaur:
Revisiting some classical linearizations of the quadratic binary optimization problem and linkages with constraint aggregations. 100858 - Brady Hunsaker, Craig A. Tovey:
Easy and hard separation of sparse and dense odd-set constraints in matching. 100849 - Todd Easton, Jennifer Tryon, Fabio Vitor:
Two-set inequalities for the binary knapsack polyhedra. 100859 - Ismail Naderi, Mohsen Rezapour, Mohammad R. Salavatipour:
Approximation schemes for Min-Sum k-Clustering. 100860 - Michael A. Henning, Johannes Pardey, Dieter Rautenbach, Florian Werner:
Mostar index and bounded maximum degree. 100861 - Shmuel Onn:
Circuit and Graver walks and linear and integer programming. 100862 - Sonia, Ankit Khandelwal:
Corrigendum to "Bilevel time minimizing transportation problem" [Discrete Optim.] 5 (4) (2008) 714-723. 100863 - Pascale Bendotti, Luca Brunod-Indrigo, Philippe Chrétienne, Bruno Escoffier:
Anchor-robust project scheduling with non-availability periods. 100864
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-12-09 23:27 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:
