default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin Mevissen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Joern Ploennigs, Markus Berger, Martin Mevissen, Kay Smarsly:
Quantum computing in civil engineering: Limitations. CoRR abs/2402.14556 (2024)- 2022
- [j6]Julien Monteil
, Anton Dekusar, Claudio Gambella, Yassine Lassoued, Martin Mevissen:
On Model Selection for Scalable Time Series Forecasting in Transport Networks. IEEE Trans. Intell. Transp. Syst. 23(7): 6699-6708 (2022)
2010 – 2019
- 2019
- [c7]Wann-Jiun Ma, Jakub Marecek, Martin Mevissen:
A Fine-Grained Variant of the Hierarchy of Lasserre. Allerton 2019: 580-586 - [c6]Claudio Gambella, Jakub Marecek, Martin Mevissen:
Projections onto the Set of Feasible Inputs and the Set of Feasible Solutions. Allerton 2019: 937-943 - [i6]Wann-Jiun Ma, Jakub Marecek, Martin Mevissen:
A Fine-Grained Variant of the Hierarchy of Lasserre. CoRR abs/1906.09586 (2019) - [i5]Julien Monteil, Anton Dekusar, Claudio Gambella, Yassine Lassoued, Martin Mevissen:
Deep Learning to Scale up Time Series Traffic Prediction. CoRR abs/1911.13042 (2019) - 2018
- [i4]Yassine Lassoued, Julien Monteil, Yingqi Gu, Giovanni Russo, Robert Shorten, Martin Mevissen:
A Hidden Markov Model for Route and Destination Prediction. CoRR abs/1804.03504 (2018) - [i3]Claudio Gambella, Jakub Marecek, Martin Mevissen, Jose Maria Fernandez Ortega, Sara Pezic Djukic, Mustafa Pezic:
Transmission-Constrained Unit Commitment. CoRR abs/1806.09408 (2018) - 2017
- [j5]Claudia D'Ambrosio, Antonio Frangioni, Andrea Lodi, Martin Mevissen:
Special issue on: Nonlinear and combinatorial methods for energy optimization. EURO J. Comput. Optim. 5(1-2): 1-3 (2017) - [j4]Bissan Ghaddar, Mathieu Claeys, Martin Mevissen, Bradley J. Eck:
Polynomial optimization for water networks: Global solutions for the valve setting problem. Eur. J. Oper. Res. 261(2): 450-459 (2017) - [c5]Yassine Lassoued, Julien Monteil, Yingqi Gu, Giovanni Russo, Robert Shorten, Martin Mevissen:
A hidden Markov model for route and destination prediction. ITSC 2017: 1-6 - 2016
- [c4]Jakub Marecek, Martin Mevissen, Jonas Christoffer Villumsen:
MINLP in transmission expansion planning. PSCC 2016: 1-8 - 2014
- [j3]Ban Kawas, Ali Koc, Marco Laumanns, Chungmok Lee, Radu Marinescu, Martin Mevissen, Nicole Taheri, Susara Van den Heever, Rudi Verago:
Unified framework and toolkit for commerce optimization under uncertainty. IBM J. Res. Dev. 58(5/6) (2014) - [c3]Nicole Taheri, Fabian R. Wirth, Bradley J. Eck, Martin Mevissen, Robert N. Shorten:
Robustness to Time Discretization Errors in Water Network Optimization. OR 2014: 581-588 - [i2]Bissan Ghaddar, Jakub Marecek, Martin Mevissen:
Optimal Power Flow as a Polynomial Optimization Problem. CoRR abs/1404.3626 (2014) - [i1]Jakub Marecek, Timothy McCoy, Martin Mevissen:
Power Flow as an Algebraic System. CoRR abs/1412.8054 (2014) - 2013
- [c2]Martin Mevissen, Emanuele Ragnoli, Jia Yuan Yu:
Data-driven Distributionally Robust Polynomial Optimization. NIPS 2013: 37-45 - 2011
- [j2]Sunyoung Kim, Masakazu Kojima, Martin Mevissen, Makoto Yamashita:
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion. Math. Program. 129(1): 33-68 (2011) - 2010
- [j1]Martin Mevissen, Masakazu Kojima:
Sdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems. Asia Pac. J. Oper. Res. 27(1): 15-38 (2010)
2000 – 2009
- 2009
- [c1]Martin Mevissen, Kosuke Yokoyama, Nobuki Takayama:
Solutions of polynomial systems derived from the steady cavity flow problem. ISSAC 2009: 255-262
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
