default search action
Discrete Applied Mathematics, Volume 308
Volume 308, February 2022
- Jon Lee, Ali Ridha Mahjoub, Giovanni Rinaldi:
Preface: Combinatorial Optimization ISCO 2018. 1-3 - Marcia Fampa:
Insight into the computation of Steiner minimal trees in Euclidean space of general dimension. 4-19 - Anja Fischer, Frank Fischer
, S. Thomas McCormick:
Matroid optimization problems with monotone monomials in the objective. 20-35 - Emily Speakman, Gennadiy Averkov
Computing the volume of the convex hull of the graph of a trilinear monomial using mixed volumes. 36-45 - Ahmed Al-Herz
A 2/3-approximation algorithm for vertex-weighted matching. 46-67 - Steffen Borgwardt, Charles Viss:
A polyhedral model for enumeration and optimization over the set of circuits. 68-83 - Matthias Köppe, Jiawei Wang
Dual-feasible functions for integer programming and combinatorial optimization: Algorithms, characterizations, and approximations. 84-106 - Kathie Cameron
A PPA parity theorem about trees in a bipartite graph. 107-110 - Flavia Bonomo-Braberman
On some special classes of contact B0-VPG graphs. 111-129 - Fanny Dufossé, Kamer Kaya
Scaling matrices and counting the perfect matchings in graphs. 130-146 - Christian Konrad, Tigran Tonoyan:
Guessing fractions of online sequences. 147-161 - Michele Barbato
The Schrijver system of the flow cone in series-parallel graphs. 162-167 - Ioannis Katsikarelis, Michael Lampis, Vangelis Th. Paschos:
Structurally parameterized d-scattered set. 168-186 - Antoine Deza
Charging station optimization for balanced electric car sharing. 187-197 - Mourad Baïou, Francisco Barahona:
Network disconnection games: A game theoretic approach to checkpoint evaluation in networks. 198-208 - Annegret Katrin Wagler:
On the Lovász-Schrijver PSD-operator on graph classes defined by clique cutsets. 209-219 - David F. Manlove, Duncan Milne, Sofiat Olaosebikan
Student-project allocation with preferences over projects: Algorithmic and experimental results. 220-234 - Raca Todosijevic
On convergence of scatter search and star paths with directional rounding for 0-1 mixed integer programs. 235-254 - Mohammad Rahim Akhavan Kazemzadeh, Tolga Bektas
Node-based Lagrangian relaxations for multicommodity capacitated fixed-charge network design. 255-275
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-12-15 01:17 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: