Search dblp for Publications

• > Home > Search

@article{DBLP:journals/disopt/AndreattaFGS19,
  author       = {Giovanni Andreatta and
                  Carla De Francesco and
                  Luigi De Giovanni and
                  Paolo Serafini},
  title        = {Star partitions on graphs},
  journal      = {Discret. Optim.},
  volume       = {33},
  pages        = {1--18},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disopt.2019.01.002},
  doi          = {10.1016/J.DISOPT.2019.01.002},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/AndreattaFGS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/EpsteinL19,
  author       = {Leah Epstein and
                  Asaf Levin},
  title        = {Robust algorithms for total completion time},
  journal      = {Discret. Optim.},
  volume       = {33},
  pages        = {70--86},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disopt.2019.03.001},
  doi          = {10.1016/J.DISOPT.2019.03.001},
  timestamp    = {Sun, 02 Oct 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/EpsteinL19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Fujishige19,
  author       = {Satoru Fujishige},
  title        = {A note on submodular function minimization by Chubanov's {LP} algorithm},
  journal      = {Discret. Optim.},
  volume       = {33},
  pages        = {140--145},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disopt.2019.04.001},
  doi          = {10.1016/J.DISOPT.2019.04.001},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/disopt/Fujishige19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/HeldKV19,
  author       = {Stephan Held and
                  Jochen K{\"{o}}nemann and
                  Jens Vygen},
  title        = {Vehicle routing with subtours},
  journal      = {Discret. Optim.},
  volume       = {33},
  pages        = {87--100},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disopt.2019.03.003},
  doi          = {10.1016/J.DISOPT.2019.03.003},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/HeldKV19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/Karzanov19,
  author       = {Alexander V. Karzanov},
  title        = {An efficient algorithm for packing cuts and (2, 3)-metrics in a planar
                  graph with three holes},
  journal      = {Discret. Optim.},
  volume       = {33},
  pages        = {118--139},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disopt.2019.04.002},
  doi          = {10.1016/J.DISOPT.2019.04.002},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/Karzanov19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/KleinertS19,
  author       = {Thomas Kleinert and
                  Martin Schmidt},
  title        = {Global optimization of multilevel electricity market models including
                  network design and graph partitioning},
  journal      = {Discret. Optim.},
  volume       = {33},
  pages        = {43--69},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disopt.2019.02.002},
  doi          = {10.1016/J.DISOPT.2019.02.002},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/KleinertS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/LendlCP19,
  author       = {Stefan Lendl and
                  Ante Custic and
                  Abraham P. Punnen},
  title        = {Combinatorial optimization with interaction costs: Complexity and
                  solvable cases},
  journal      = {Discret. Optim.},
  volume       = {33},
  pages        = {101--117},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disopt.2019.03.004},
  doi          = {10.1016/J.DISOPT.2019.03.004},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/LendlCP19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/MaierUH19,
  author       = {Andrea Maier and
                  Thomas Ullmert and
                  Horst W. Hamacher},
  title        = {Planar multifacility location problems with tree structure and finite
                  dominating sets},
  journal      = {Discret. Optim.},
  volume       = {33},
  pages        = {19--42},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disopt.2019.02.001},
  doi          = {10.1016/J.DISOPT.2019.02.001},
  timestamp    = {Sun, 19 Jan 2025 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/MaierUH19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/PanCALM19,
  author       = {Stefania Pan and
                  Roberto Wolfler Calvo and
                  Mahuna Akplogan and
                  Lucas L{\'{e}}tocart and
                  Nora Touati Moungla},
  title        = {A dual ascent heuristic for obtaining a lower bound of the generalized
                  set partitioning problem with convexity constraints},
  journal      = {Discret. Optim.},
  volume       = {33},
  pages        = {146--168},
  year         = {2019},
  url          = {https://doi.org/10.1016/j.disopt.2019.05.001},
  doi          = {10.1016/J.DISOPT.2019.05.001},
  timestamp    = {Sat, 22 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/PanCALM19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}