activity
20172023
most citedA Branch and Bound Algorithm for Coalition Structure Generation over Graphs

1 citations · 1 across the 4 of their papers we have counts for

collaborators

5 papers

cs.MS2023

Graph4J -- A computationally efficient Java library for graph algorithms

Cristian Frăsinaru, Emanuel Florentin Olariu

Graph algorithms play an important role in many computer science areas. In order to solve problems that can be modeled using graphs, it is necessary to use a data structure that ca…

math.CO2021

Improving Lower Bounds for Equitable Chromatic Number

Emanuel Florentin Olariu, Cristian Frasinaru

In many practical applications the underlying graph must be as equitable colored as possible. A coloring is called equitable if the number of vertices colored with each color diffe…

math.OC2020

Multiple-Depot Vehicle Scheduling Problem Heuristics

Emanuel Florentin Olariu, Cristian Frasinaru

The Multiple-Depot Vehicle Scheduling Problem (MDVSP) is very important in the planning process of transport systems. It consists in assigning a set of trips to a set of vehicles i…

cs.GT2020★ 1 cited

A Branch and Bound Algorithm for Coalition Structure Generation over Graphs

Emanuel Florentin Olariu, Cristian Frasinaru, Albert Abel Policiuc

We give a column generation based branch and bound algorithm for coalition structure generation over graphs problem using valuation functions for which this problem is proven to be…

cs.DS2017

An Improved Subsumption Testing Algorithm for the Optimal-Size Sorting Network Problem

Cristian Frasinaru, Madalina Raschip

In this paper a new method for checking the subsumption relation for the optimal-size sorting network problem is described. The new approach is based on creating a bipartite graph…