scispace - formally typeset
C

Chrysafis Vogiatzis

Researcher at University of Illinois at Urbana–Champaign

Publications -  46
Citations -  418

Chrysafis Vogiatzis is an academic researcher from University of Illinois at Urbana–Champaign. The author has contributed to research in topics: Centrality & Computer science. The author has an hindex of 10, co-authored 40 publications receiving 255 citations. Previous affiliations of Chrysafis Vogiatzis include North Carolina Agricultural and Technical State University & North Dakota State University.

Papers
More filters
Journal ArticleDOI

Selective Maintenance Optimization for Multi-state Systems Considering Stochastically Dependent Components and Stochastic Imperfect Maintenance Actions

TL;DR: The selective maintenance bi-objective optimization problem is modelled considering both the expected value and variance of the system reliability as objective functions and time and budget are considered as constraints for finding the optimal maintenance strategy.
Journal ArticleDOI

Biomass feedstock supply chain network design with biomass conversion incentives

TL;DR: In this article, a decision support system using a large-scale linear program with the goal of maximizing profit with and without the emission cost was developed to identify farms that would benefit society were they to be incentivized under a biomass crop assistance program.
Journal ArticleDOI

An integer programming approach for finding the most and the least central cliques

TL;DR: The findings indicate that there are considerable variations between the centrality values of large cliques within the same networks, and the most central cliques in graphs are not necessarily the largest ones.
Journal ArticleDOI

A column generation algorithm for vehicle scheduling and routing problems

TL;DR: A variant of a truckload open vehicle routing problem with time windows, suitable for modeling vehicle routing operations during a humanitarian crisis, is considered and it is shown that the path-based model, when solved with the column generation algorithm, outperforms the arc- based model in terms of solution time without sacrificing the solution quality.
Journal ArticleDOI

Integer programming models for the multidimensional assignment problem with star costs

TL;DR: This work considers a variant of the multidimensional assignment problem with decomposable costs in which the resulting optimal assignment is described as a set of disjoint stars, and introduces a continuous nonlinear program and its linearization, along with additional valid inequalities that improve the lower bounds.