default search action
Discrete Optimization, Volume 35
Volume 35, February 2020
- Pierre Laroche, Franc Marchetti, Sébastien Martin, Anass Nagih, Zsuzsanna Róka:
Multiple Bipartite Complete Matching Vertex Blocker Problem: Complexity, polyhedral analysis and Branch-and-Cut. 100551 - Ralf Borndörfer, Heide Hoppmann, Marika Karbstein, Niels Lindner:
Separation of cycle inequalities in periodic timetabling. 100552 - Mateusz Miotk, Jerzy Topp, Pawel Zylinski:
Disjoint dominating and 2-dominating sets in graphs. 100553 - Fatemeh Keshavarz-Kohjerdi, Alireza Bagheri:
Linear-time algorithms for finding Hamiltonian and longest (s, t)-paths in C-shaped grid graphs. 100554 - Amal Benhamiche, Ali Ridha Mahjoub, Nancy Perrot, Eduardo Uchoa:
Capacitated Multi-Layer Network Design with Unsplittable Demands: Polyhedra and Branch-and-Cut. 100555 - Mitre Costa Dourado, Stefan Ehard, Lucia Draque Penso, Dieter Rautenbach:
Partial immunization of trees. 100568
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.