Janez Povh

Lidija Zadnik Stirn

Janez Zerovnik

Central Eur. J. Oper. Res., September, 2023

Electricity consumption prediction using artificial intelligence.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., September, 2023

Solving SDP relaxations of Max-Cut problem with large number of hypermetric inequalities by L-BFGS-B.

[BibT_eX]

[DOI]

Timotej Hrga

Optim. Lett., June, 2023

2022

Clustering as a dual problem to colouring.

[BibT_eX]

[DOI]

Comput. Appl. Math., June, 2022

BiqBin: A Parallel Branch-and-bound Solver for Binary Quadratic Problems with Linear Constraints.

[BibT_eX]

[DOI]

ACM Trans. Math. Softw., 2022

Sparse noncommutative polynomial optimization.

[BibT_eX]

[DOI]

Victor Magron

Math. Program., 2022

Four algorithms to solve symmetric multi-type non-negative matrix tri-factorization problem.

[BibT_eX]

[DOI]

J. Glob. Optim., 2022

Data-driven engineering design: A systematic review using scientometric approach.

[BibT_eX]

[DOI]

Adv. Eng. Informatics, 2022

2021

MADAM: a parallel exact solver for max-cut based on semidefinite programming and ADMM.

[BibT_eX]

[DOI]

Timotej Hrga

Comput. Optim. Appl., 2021

On sufficient properties of sufficient matrices.

[BibT_eX]

[DOI]

Janez Zerovnik

Central Eur. J. Oper. Res., 2021

Methodologies and applications for resilient global development from the aspect of SDI-SOR special issues of CJOR.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2021

Modeling Public Transport Network System by Using Statistics, Network Theory and Ant Colony Optimization.

[BibT_eX]

[DOI]

Comput. Informatics, 2021

2020

The Impact of the Complexity of Harmony on the Acceptability of Music.

[BibT_eX]

[DOI]

Lorena Mihelac

ACM Trans. Appl. Percept., 2020

Feasible Corrector-Predictor Interior-Point Algorithm for P<sub>*</sub> (κ)-Linear Complementarity Problems Based on a New Search Direction.

[BibT_eX]

[DOI]

SIAM J. Optim., 2020

A Block Coordinate Descent-based Projected Gradient Algorithm for Orthogonal Non-negative Matrix Factorization.

[BibT_eX]

[DOI]

Soodabeh Asadi

CoRR, 2020

AI based algorithms for the detection of (ir)regularity in musical structure.

[BibT_eX]

[DOI]

Lorena Mihelac

Int. J. Appl. Math. Comput. Sci., 2020

Public transport analyzing using bee colony.

[BibT_eX]

[DOI]

Matej Babic

Bozo Soldo

Proceedings of the 43rd International Convention on Information, 2020

2019

A new approximation hierarchy for polynomial conic optimization.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2019

BiqBin: Moving Boundaries for NP-hard Problems by HPC.

[BibT_eX]

[DOI]

Proceedings of the Advances in High Performance Computing, 2019

2018

Minimizer Extraction in Polynomial Optimization Is Robust.

[BibT_eX]

[DOI]

Jurij Volcic

SIAM J. Optim., 2018

Is science driven by principal investigators?

[BibT_eX]

[DOI]

Scientometrics, 2018

Annotated news corpora and a lexicon for sentiment analysis in Slovene.

[BibT_eX]

[DOI]

Joze Bucar

Martin Znidarsic

Lang. Resour. Evaluation, 2018

2017

Analysis of Slovenian research community through bibliographic networks.

[BibT_eX]

[DOI]

Scientometrics, 2017

Editorial.

[BibT_eX]

[DOI]

Lidija Zadnik Stirn

Janez Zerovnik

Central Eur. J. Oper. Res., 2017

2016

Constrained trace-optimization of polynomials in freely noncommuting variables.

[BibT_eX]

[DOI]

J. Glob. Optim., 2016

2015

On an extension of Pólya's Positivstellensatz.

[BibT_eX]

[DOI]

J. Glob. Optim., 2015

Rational sums of hermitian squares of free noncommutative polynomials.

[BibT_eX]

[DOI]

Kristijan Cafuta

Ars Math. Contemp., 2015

Text Detection in Document Images by Machine Learning Algorithms.

[BibT_eX]

[DOI]

Darko Zelenika

Bernard Zenko

Proceedings of the 9th International Conference on Computer Recognition Systems CORES 2015, 2015

Sentiment Classification of the Slovenian News Texts.

[BibT_eX]

[DOI]

Joze Bucar

Martin Znidarsic

Proceedings of the 9th International Conference on Computer Recognition Systems CORES 2015, 2015

2014

Community structure and the evolution of interdisciplinarity in Slovenia's scientific collaboration network.

[BibT_eX]

[DOI]

CoRR, 2014

2013

On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets.

[BibT_eX]

[DOI]

Gabriele Eichfelder

Optim. Lett., 2013

Erratum to: On the set-semidefinite representation of nonconvex quadratic programs over arbitrary feasible sets.

[BibT_eX]

[DOI]

Gabriele Eichfelder

Optim. Lett., 2013

The tracial moment problem and trace-optimization of polynomials.

[BibT_eX]

[DOI]

Math. Program., 2013

Moment Approximations for Set-Semidefinite Polynomials.

[BibT_eX]

[DOI]

J. Optim. Theory Appl., 2013

Algorithmic aspects of sums of Hermitian squares of noncommutative polynomials.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2013

New heuristics for the vertex coloring problem based on semidefinite programming.

[BibT_eX]

[DOI]

Jelena Govorcin

Nebojsa Gvozdenovic

Central Eur. J. Oper. Res., 2013

2012

Constrained Polynomial Optimization Problems with Noncommuting Variables.

[BibT_eX]

[DOI]

Kristijan Cafuta

SIAM J. Optim., 2012

2011

NCSOStools: a computer algebra system for symbolic and numerical computation with noncommutative polynomials.

[BibT_eX]

[DOI]

Kristijan Cafuta

Optim. Methods Softw., 2011

Editorial.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2011

2010

Semidefinite approximations for quadratic programs over orthogonal matrices.

[BibT_eX]

[DOI]

J. Glob. Optim., 2010

2009

Regularization Methods for Semidefinite Programming.

[BibT_eX]

[DOI]

SIAM J. Optim., 2009

Copositive and semidefinite relaxations of the quadratic assignment problem.

[BibT_eX]

[DOI]

Franz Rendl

Discret. Optim., 2009

2007

A Copositive Programming Approach to Graph Partitioning.

[BibT_eX]

[DOI]

Franz Rendl

SIAM J. Optim., 2007

2006

A Boundary Point Method to Solve Semidefinite Programs.

[BibT_eX]

[DOI]