default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Optimization, Volume 31
Volume 31, February 2019
- Batmend Horoldagva
, Kinkar Chandra Das, Tsend-Ayush Selenge:
On ve-degree and ev-degree of graphs. 1-7 - Denis Cornaz, Fabio Furini, Mathieu Lacroix, Enrico Malaguti, Ali Ridha Mahjoub, Sébastien Martin:
The vertex k-cut problem. 8-28 - Ruben Hoeksma, Marc Uetz:
The price of anarchy for utilitarian scheduling games on related machines. 29-39 - Ricardo C. Corrêa, Diego Delle Donne, Javier Marenco:
On the combinatorics of the 2-class classification problem. 40-55 - Karthekeyan Chandrasekaran, Corinna Gottschalk, Jochen Könemann, Britta Peis, Daniel Schmand, Andreas Wierz:
Additive stabilizers for unstable graphs. 56-78 - Elina Rönnberg, Torbjörn Larsson:
An integer optimality condition for column generation on zero-one linear programs. 79-92 - Massimo Di Francesco, Claudio Gentile, Silvia Schirra, Giuseppe Stecca, Paola Zuddas:
An integral LP relaxation for a drayage problem. 93-102 - Denis Cornaz, Roland Grappe, Mathieu Lacroix:
Trader multiflow and box-TDI systems in series-parallel graphs. 103-114 - K. T. Arasu, Manil T. Mohan:
Entropy of orthogonal matrices and minimum distance orthostochastic matrices from the uniform van der Waerden matrices. 115-144
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 00:13 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:
