SEARCH

SEARCH BY CITATION

Cited in:

CrossRef

This article has been cited by:

  1. 1
    Anja Fischer, An Analysis of the Asymmetric Quadratic Traveling Salesman Polytope, SIAM Journal on Discrete Mathematics, 2014, 28, 1, 240

    CrossRef

  2. 2
    A. Fischer, F. Fischer, G. Jäger, J. Keilwagen, P. Molitor, I. Grosse, Exact algorithms and heuristics for the Quadratic Traveling Salesman Problem with an application in bioinformatics, Discrete Applied Mathematics, 2014, 166, 97

    CrossRef

  3. 3
    Giulia Galbiati, Stefano Gualandi, Francesco Maffioli, On Minimum Reload Cost Cycle Cover, Discrete Applied Mathematics, 2014, 164, 112

    CrossRef

  4. 4
    Didem Gözüpek, Mordechai Shalom, Ariella Voloshin, Shmuel Zaks, On the complexity of constructing minimum changeover cost arborescences, Theoretical Computer Science, 2014, 540-541, 40

    CrossRef

  5. 5
    Anja Fischer, Frank Fischer, An extended approach for lifting clique tree inequalities, Journal of Combinatorial Optimization, 2013,

    CrossRef

  6. 6
    Laurent Gourvès, Adria Lyra, Carlos A. Martinhon, Jérôme Monnot, Complexity of trails, paths and circuits in arc-colored digraphs, Discrete Applied Mathematics, 2013, 161, 6, 819

    CrossRef

  7. 7
    Edoardo Amaldi, Federico Malucelli, In memoriam of Francesco Maffioli (1941–2012), International Transactions in Operational Research, 2013, 20, 3
  8. 8
    Anja Fischer, Christoph Helmberg, The symmetric quadratic traveling salesman problem, Mathematical Programming, 2013, 142, 1-2, 205

    CrossRef

  9. 9
    Ioannis Gamvros, Luis Gouveia, S. Raghavan, Reload cost trees and network design, Networks, 2012, 59, 4