Martin Mevissen

According to our database1, Martin Mevissen authored at least 18 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Quantum computing in civil engineering: Limitations.
CoRR, 2024

2022
On Model Selection for Scalable Time Series Forecasting in Transport Networks.
IEEE Trans. Intell. Transp. Syst., 2022

2019
Deep Learning to Scale up Time Series Traffic Prediction.
CoRR, 2019

A Fine-Grained Variant of the Hierarchy of Lasserre.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

Projections onto the Set of Feasible Inputs and the Set of Feasible Solutions.
Proceedings of the 57th Annual Allerton Conference on Communication, 2019

2018
Transmission-Constrained Unit Commitment.
CoRR, 2018

2017
Polynomial optimization for water networks: Global solutions for the valve setting problem.
Eur. J. Oper. Res., 2017

Special issue on: Nonlinear and combinatorial methods for energy optimization.
EURO J. Comput. Optim., 2017

A hidden Markov model for route and destination prediction.
Proceedings of the 20th IEEE International Conference on Intelligent Transportation Systems, 2017

2016
MINLP in transmission expansion planning.
Proceedings of the Power Systems Computation Conference, 2016

2014
Unified framework and toolkit for commerce optimization under uncertainty.
IBM J. Res. Dev., 2014

Power Flow as an Algebraic System.
CoRR, 2014

Optimal Power Flow as a Polynomial Optimization Problem.
CoRR, 2014

Robustness to Time Discretization Errors in Water Network Optimization.
Proceedings of the Operations Research Proceedings 2014, 2014

2013
Data-driven Distributionally Robust Polynomial Optimization.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

2011
Exploiting sparsity in linear and nonlinear matrix inequalities via positive semidefinite matrix completion.
Math. Program., 2011

2010
Sdp Relaxations for Quadratic Optimization Problems Derived from Polynomial Optimization Problems.
Asia Pac. J. Oper. Res., 2010

2009
Solutions of polynomial systems derived from the steady cavity flow problem.
Proceedings of the Symbolic and Algebraic Computation, International Symposium, 2009


  Loading...