Search dblp for Publications

export results for "Maximilian Merkert"

 download as .bib file

@article{DBLP:journals/dam/BarmannGMWM23,
  author       = {Andreas B{\"{a}}rmann and
                  Patrick Gemander and
                  Maximilian Merkert and
                  Ann{-}Kathrin Wiertz and
                  Francisco Javier Zaragoza Mart{\'{\i}}nez},
  title        = {Algorithms for the clique problem with multiple-choice constraints
                  under a series-parallel dependency graph},
  journal      = {Discret. Appl. Math.},
  volume       = {324},
  pages        = {145--166},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.dam.2022.09.015},
  doi          = {10.1016/J.DAM.2022.09.015},
  timestamp    = {Sun, 25 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BarmannGMWM23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgo/MerkertOW22,
  author       = {Maximilian Merkert and
                  Galina Orlinskaya and
                  Dieter Weninger},
  title        = {An exact projection-based algorithm for bilevel mixed-integer problems
                  with nonlinearities},
  journal      = {J. Glob. Optim.},
  volume       = {84},
  number       = {3},
  pages        = {607--650},
  year         = {2022},
  url          = {https://doi.org/10.1007/s10898-022-01172-w},
  doi          = {10.1007/S10898-022-01172-W},
  timestamp    = {Sun, 13 Nov 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgo/MerkertOW22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jota/BarmannGMM22,
  author       = {Andreas B{\"{a}}rmann and
                  Patrick Gemander and
                  Alexander Martin and
                  Maximilian Merkert},
  title        = {On Recognizing Staircase Compatibility},
  journal      = {J. Optim. Theory Appl.},
  volume       = {195},
  number       = {2},
  pages        = {449--479},
  year         = {2022},
  url          = {https://doi.org/10.1007/s10957-022-02091-2},
  doi          = {10.1007/S10957-022-02091-2},
  timestamp    = {Tue, 28 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jota/BarmannGMM22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/networks/LeMSHS22,
  author       = {Do Duc Le and
                  Maximilian Merkert and
                  Stephan Sorgatz and
                  Mirko Hahn and
                  Sebastian Sager},
  title        = {Autonomous traffic at intersections: An optimization-based analysis
                  of possible time, energy, and {CO} savings},
  journal      = {Networks},
  volume       = {79},
  number       = {3},
  pages        = {338--363},
  year         = {2022},
  url          = {https://doi.org/10.1002/net.22078},
  doi          = {10.1002/NET.22078},
  timestamp    = {Fri, 13 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/networks/LeMSHS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/jgo/LiersMMMM21,
  author       = {Frauke Liers and
                  Alexander Martin and
                  Maximilian Merkert and
                  Nick Mertens and
                  Dennis Michaels},
  title        = {Solving mixed-integer nonlinear optimization problems using simultaneous
                  convexification: a case study for gas networks},
  journal      = {J. Glob. Optim.},
  volume       = {80},
  number       = {2},
  pages        = {307--340},
  year         = {2021},
  url          = {https://doi.org/10.1007/s10898-020-00974-0},
  doi          = {10.1007/S10898-020-00974-0},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jgo/LiersMMMM21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/dam/BarmannGM20,
  author       = {Andreas B{\"{a}}rmann and
                  Patrick Gemander and
                  Maximilian Merkert},
  title        = {The clique problem with multiple-choice constraints under a cycle-free
                  dependency graph},
  journal      = {Discret. Appl. Math.},
  volume       = {283},
  pages        = {59--77},
  year         = {2020},
  url          = {https://doi.org/10.1016/j.dam.2019.12.015},
  doi          = {10.1016/J.DAM.2019.12.015},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/dam/BarmannGM20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/disopt/BarmannGMS18,
  author       = {Andreas B{\"{a}}rmann and
                  Thorsten Gellermann and
                  Maximilian Merkert and
                  Oskar Schneider},
  title        = {Staircase compatibility and its applications in scheduling and piecewise
                  linearization},
  journal      = {Discret. Optim.},
  volume       = {29},
  pages        = {111--132},
  year         = {2018},
  url          = {https://doi.org/10.1016/j.disopt.2018.04.001},
  doi          = {10.1016/J.DISOPT.2018.04.001},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/disopt/BarmannGMS18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/siamjo/LiersM16,
  author       = {Frauke Liers and
                  Maximilian Merkert},
  title        = {Structural Investigation of Piecewise Linearized Network Flow Problems},
  journal      = {{SIAM} J. Optim.},
  volume       = {26},
  number       = {4},
  pages        = {2863--2886},
  year         = {2016},
  url          = {https://doi.org/10.1137/15M1006751},
  doi          = {10.1137/15M1006751},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/siamjo/LiersM16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/mpc/BarmannLMMTW15,
  author       = {Andreas B{\"{a}}rmann and
                  Frauke Liers and
                  Alexander Martin and
                  Maximilian Merkert and
                  Christoph Thurner and
                  Dieter Weninger},
  title        = {Solving network design problems via iterative aggregation},
  journal      = {Math. Program. Comput.},
  volume       = {7},
  number       = {2},
  pages        = {189--217},
  year         = {2015},
  url          = {https://doi.org/10.1007/s12532-015-0079-1},
  doi          = {10.1007/S12532-015-0079-1},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/mpc/BarmannLMMTW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/wg/LeithauserKM12,
  author       = {Neele Leith{\"{a}}user and
                  Sven Oliver Krumke and
                  Maximilian Merkert},
  editor       = {Martin Charles Golumbic and
                  Michal Stern and
                  Avivit Levy and
                  Gila Morgenstern},
  title        = {Approximating Infeasible 2VPI-Systems},
  booktitle    = {Graph-Theoretic Concepts in Computer Science - 38th International
                  Workshop, {WG} 2012, Jerusalem, Israel, June 26-28, 2012, Revised
                  Selcted Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {7551},
  pages        = {225--236},
  publisher    = {Springer},
  year         = {2012},
  url          = {https://doi.org/10.1007/978-3-642-34611-8\_24},
  doi          = {10.1007/978-3-642-34611-8\_24},
  timestamp    = {Mon, 03 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/wg/LeithauserKM12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

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.