


default search action
Discrete Optimization, Volume 29
Volume 29, August 2018
- Ali Reza Sepasian:

Upgrading the 1-center problem with edge length variables on a tree. 1-17 - François Clautiaux, Ruslan Sadykov

, François Vanderbeck, Quentin Viaud:
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem. 18-44 - Michitaka Furuya, Masaki Koyanagi, Maho Yokota:

Upper bound on 3-rainbow domination in graphs with minimum degree 2. 45-76 - John Martinovic, Guntram Scheithauer:

The skiving stock problem and its relation to hypergraph matchings. 77-102 - Dmitriy S. Malyshev

, Dmitry V. Gribanov:
The computational complexity of dominating set problems for instances with bounded minors of constraint matrices. 103-110 - Andreas Bärmann, Thorsten Gellermann, Maximilian Merkert

, Oskar Schneider:
Staircase compatibility and its applications in scheduling and piecewise linearization. 111-132 - Walid Ben-Ameur, Antoine Glorieux, José Neto:

Complete formulations of polytopes related to extensions of assignment matrices. 133-147 - Daniel Porumbel:

From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints. 148-173 - Katarína Cechlárová

, Bettina Klaus
, David F. Manlove:
Pareto optimal matchings of students to courses in the presence of prerequisites. 174-195

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














