Konstantinos Kaparis

Orcid: 0000-0002-5024-4674

According to our database1, Konstantinos Kaparis authored at least 16 papers between 2008 and 2023.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On cut polytopes and graph minors.
Discret. Optim., November, 2023

Analysis, prioritization and strategic planning of flood mitigation projects based on sustainability dimensions and a spatial/value AHP-GIS system.
Expert Syst. Appl., 2023

Introducing a New Metric for Improving Trustworthiness in Real Time Object Detection.
Proceedings of the Dynamics of Information Systems - 6th International Conference, 2023

2022
Generalised 2-circulant inequalities for the max-cut problem.
Oper. Res. Lett., 2022

A cut-and-branch algorithm for the Quadratic Knapsack Problem.
Discret. Optim., 2022

2020
On matroid parity and matching polytopes.
Discret. Appl. Math., 2020

2018
A note on the 2-circulant inequalities for the max-cut problem.
Oper. Res. Lett., 2018

2015
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs.
Math. Program., 2015

2012
Complexity results for the gap inequalities for the max-cut problem.
Oper. Res. Lett., 2012

Operations research in the space industry.
Eur. J. Oper. Res., 2012

Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm.
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011
Gap inequalities for non-convex mixed-integer quadratic programs.
Oper. Res. Lett., 2011

Supply chain forecasting for the UK Chinook fleet.
OR Insight, 2011

2010
Separation algorithms for 0-1 knapsack polytopes.
Math. Program., 2010

2008
Multi-product economic lot scheduling problem with separate production lines for manufacturing and remanufacturing.
Eur. J. Oper. Res., 2008

Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem.
Eur. J. Oper. Res., 2008


  Loading...