Search Results - Lendl, Stefan

Refine Results
  1. 1
    Continuous facility location on graphs

    Continuous facility location on graphs by Hartmann, Tim A., Lendl, Stefan, Woeginger, Gerhard J.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Matroid bases with cardinality constraints on the intersection

    Matroid bases with cardinality constraints on the intersection by Lendl, Stefan, Peis, Britta, Timmermans, Veerle

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  3. 3
    The Steiner cycle and path cover problem on interval graphs

    The Steiner cycle and path cover problem on interval graphs by Ćustić, Ante, Lendl, Stefan

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  4. 4
    Non-Preemptive Tree Packing

    Non-Preemptive Tree Packing by Lendl, Stefan, Woeginger, Gerhard, Wulf, Lasse

    Published in Algorithmica
    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  5. 5
    Dispersing Obnoxious Facilities on a Graph

    Dispersing Obnoxious Facilities on a Graph by Grigoriev, Alexander, Hartmann, Tim A., Lendl, Stefan, Woeginger, Gerhard J.

    Published in Algorithmica
    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  6. 6
    Recoverable robust representatives selection problems with discrete budgeted uncertainty

    Recoverable robust representatives selection problems with discrete budgeted uncertainty by Goerigk, Marc, Lendl, Stefan, Wulf, Lasse

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    Two-Stage robust optimization problems with two-stage uncertainty

    Two-Stage robust optimization problems with two-stage uncertainty by Goerigk, Marc, Lendl, Stefan, Wulf, Lasse

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  8. 8
    On the complexity of robust multi-stage problems with discrete recourse

    On the complexity of robust multi-stage problems with discrete recourse by Goerigk, Marc, Lendl, Stefan, Wulf, Lasse

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  9. 9
    Assistance and interdiction problems on interval graphs

    Assistance and interdiction problems on interval graphs by Hoang, Hung P., Lendl, Stefan, Wulf, Lasse

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  10. 10
    Robust Combinatorial Optimization with Locally Budgeted Uncertainty

    Robust Combinatorial Optimization with Locally Budgeted Uncertainty by Goerigk, Marc, Lendl, Stefan

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  11. 11
    A linear time algorithm for linearizing quadratic and higher-order shortest path problems

    A linear time algorithm for linearizing quadratic and higher-order shortest path problems by Çela, Eranda, Klinz, Bettina, Lendl, Stefan, Woeginger, Gerhard J., Wulf, Lasse

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  12. 12
    A linear time algorithm for the robust recoverable selection problem

    A linear time algorithm for the robust recoverable selection problem by Lachmann, Thomas, Lendl, Stefan, Woeginger, Gerhard J.

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  13. 13
    Combinatorial optimization with interaction costs: Complexity and solvable cases

    Combinatorial optimization with interaction costs: Complexity and solvable cases by Lendl, Stefan, Ćustić, Ante, Punnen, Abraham P.

    Published in Discrete optimization
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  14. 14
    Allocation of indivisible items with individual preference graphs

    Allocation of indivisible items with individual preference graphs by Chiarelli, Nina, Dallard, Clément, Darmann, Andreas, Lendl, Stefan, Milanič, Martin, Muršič, Peter, Pferschy, Ulrich, Pivač, Nevena

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  15. 15
    Dispersing Obnoxious Facilities on Graphs by Rounding Distances

    Dispersing Obnoxious Facilities on Graphs by Rounding Distances by Hartmann, Tim A, Lendl, Stefan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  16. 16
    Robust Combinatorial Optimization with Locally Budgeted Uncertainty

    Robust Combinatorial Optimization with Locally Budgeted Uncertainty by Goerigk, Marc, Lendl, Stefan

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  17. 17
    On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy

    On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy by Goerigk, Marc, Lendl, Stefan, Wulf, Lasse

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  18. 18
    Two-Stage Robust Optimization Problems with Two-Stage Uncertainty

    Two-Stage Robust Optimization Problems with Two-Stage Uncertainty by Goerigk, Marc, Lendl, Stefan, Wulf, Lasse

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  19. 19
    On the Recoverable Traveling Salesman Problem

    On the Recoverable Traveling Salesman Problem by Goerigk, Marc, Lendl, Stefan, Wulf, Lasse

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  20. 20
    Assistance and Interdiction Problems on Interval Graphs

    Assistance and Interdiction Problems on Interval Graphs by Hoang, Hung P, Lendl, Stefan, Wulf, Lasse

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: