Dimitri J. Papageorgiou

Orcid: 0000-0003-3744-0045

According to our database1, Dimitri J. Papageorgiou authored at least 26 papers between 2011 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Equilibrium modeling and solution approaches inspired by nonconvex bilevel programming.
Comput. Optim. Appl., March, 2024

Identifying Key Drivers for a National Transition to Low Carbon Energy using Agent-based Supply Chain Models.
Comput. Chem. Eng., 2024

2023
Maritime inventory routing: recent trends and future directions.
Int. Trans. Oper. Res., November, 2023

Data-driven distributionally robust optimization for long-term contract vs. spot allocation decisions: Application to electricity markets.
Comput. Chem. Eng., November, 2023

Pooling problems under perfect and imperfect competition.
Comput. Chem. Eng., 2023

2022
The Machine Learning for Combinatorial Optimization Competition (ML4CO): Results and Insights.
CoRR, 2022

Generation expansion planning with revenue adequacy constraints.
Comput. Oper. Res., 2022

Deep lifted decision rules for two-stage adaptive optimization problems.
Comput. Chem. Eng., 2022

2021
A note on semi-infinite program bounding methods.
Optim. Lett., 2021

Hybrid strategies using linear and piecewise-linear decision rules for multistage adaptive linear optimization.
Eur. J. Oper. Res., 2021

Active metric learning for supervised classification.
Comput. Chem. Eng., 2021


2020
Information-theoretic sensor planning for large-scale production surveillance via deep reinforcement learning.
Comput. Chem. Eng., 2020

Proactive and reactive scheduling of the steelmaking and continuous casting process through adaptive robust optimization.
Comput. Chem. Eng., 2020

2019
Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing.
Comput. Oper. Res., 2019

2018
Deterministic electric power infrastructure planning: Mixed-integer programming model and nested decomposition algorithm.
Eur. J. Oper. Res., 2018

Pseudo basic steps: bound improvement guarantees from Lagrangian decomposition in convex disjunctive programming.
EURO J. Comput. Optim., 2018

Active Metric Learning for Supervised Classification.
CoRR, 2018

2016
An MILP-MINLP decomposition method for the global optimization of a source based model of the multiperiod blending problem.
Comput. Chem. Eng., 2016

2015
Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems.
Transp. Sci., 2015

2014
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing.
INFORMS J. Comput., 2014

MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results.
Eur. J. Oper. Res., 2014

2013
Probabilistic Set Covering with Correlations.
Oper. Res., 2013

2012
Optimization in maritime inventory routing.
PhD thesis, 2012

Fixed-Charge Transportation with Product Blending.
Transp. Sci., 2012

2011
Track-to-Track Association and Ambiguity Management in the Presence of Sensor Bias.
J. Adv. Inf. Fusion, 2011


  Loading...