default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKonstantinos Kaparis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c3]Kyriakos Bitsis, Alexandros Spanos, Konstantinos Kaparis, Georgios Zois:
WEEE Flow for Magnets. APMS (1) 2024: 217-231- 2023
- [j14]Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos
:
On cut polytopes and graph minors. Discret. Optim. 50: 100807 (2023) - [j13]Marina T. Aidinidou, Konstantinos Kaparis, Andreas C. Georgiou:
Analysis, prioritization and strategic planning of flood mitigation projects based on sustainability dimensions and a spatial/value AHP-GIS system. Expert Syst. Appl. 211: 118566 (2023) - [c2]Konstantinos Tarkasis, Konstantinos Kaparis, Andreas C. Georgiou:
Introducing a New Metric for Improving Trustworthiness in Real Time Object Detection. DIS 2023: 242-249 - 2022
- [j12]Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford:
A cut-and-branch algorithm for the Quadratic Knapsack Problem. Discret. Optim. 44(Part): 100579 (2022) - [j11]Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos:
Generalised 2-circulant inequalities for the max-cut problem. Oper. Res. Lett. 50(2): 122-128 (2022) - 2020
- [j10]Konstantinos Kaparis, Adam N. Letchford, Ioannis Mourtos:
On matroid parity and matching polytopes. Discret. Appl. Math. 284: 322-331 (2020)
2010 – 2019
- 2018
- [j9]Konstantinos Kaparis, Adam N. Letchford:
A note on the 2-circulant inequalities for the max-cut problem. Oper. Res. Lett. 46(4): 443-447 (2018) - 2015
- [j8]Franklin Djeumou Fomeni, Konstantinos Kaparis, Adam N. Letchford:
Cutting planes for RLT relaxations of mixed 0-1 polynomial programs. Math. Program. 151(2): 639-658 (2015) - 2012
- [j7]Jörg Fliege, Konstantinos Kaparis, Banafsheh Khosravi:
Operations research in the space industry. Eur. J. Oper. Res. 217(2): 233-240 (2012) - [j6]Laura Galli, Konstantinos Kaparis, Adam N. Letchford:
Complexity results for the gap inequalities for the max-cut problem. Oper. Res. Lett. 40(3): 149-152 (2012) - [c1]Laura Galli, Konstantinos Kaparis, Adam N. Letchford:
Gap Inequalities for the Max-Cut Problem: A Cutting-Plane Algorithm. ISCO 2012: 178-188 - 2011
- [j5]Matthew Downing, Max Chipulu, Udechukwu Ojiako, Konstantinos Kaparis:
Supply chain forecasting for the UK Chinook fleet. OR Insight 24(2): 110-130 (2011) - [j4]Laura Galli, Konstantinos Kaparis, Adam N. Letchford:
Gap inequalities for non-convex mixed-integer quadratic programs. Oper. Res. Lett. 39(5): 297-300 (2011) - 2010
- [j3]Konstantinos Kaparis, Adam N. Letchford:
Separation algorithms for 0-1 knapsack polytopes. Math. Program. 124(1-2): 69-91 (2010)
2000 – 2009
- 2008
- [j2]Konstantinos Kaparis, Adam N. Letchford:
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem. Eur. J. Oper. Res. 186(1): 91-103 (2008) - [j1]Ruud H. Teunter, Konstantinos Kaparis, Ou Tang:
Multi-product economic lot scheduling problem with separate production lines for manufacturing and remanufacturing. Eur. J. Oper. Res. 191(3): 1241-1253 (2008)
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-10-10 21:18 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:
