Y. Frota

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Efficient solutions to the \(m\)-machine robust flow shop under budgeted uncertainty Annals of Operations Research	2024-08-15	Paper
Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry Computers & Operations Research	2023-07-04	Paper
UAVs routes optimization on smart cities and regions RAIRO - Operations Research	2022-05-09	Paper
Exact solutions for the two-machine robust flow shop with budgeted uncertainty European Journal of Operational Research	2022-03-11	Paper
A matheuristic approach for the maximum balanced subgraph of a signed graph RAIRO - Operations Research	2022-02-21	Paper
Integer programming formulations and efficient local search for relaxed correlation clustering Journal of Global Optimization	2021-11-26	Paper
On the exact solution of vehicle routing problems with backhauls European Journal of Operational Research	2020-06-17	Paper
A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph Discrete Applied Mathematics	2019-05-17	Paper
Evaluating balancing on social networks through the efficient solution of correlation clustering problems EURO Journal on Computational Optimization	2018-01-12	Paper
A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives Discrete Applied Mathematics	2015-09-22	Paper
The maximum balanced subgraph of a signed graph: applications and solution approaches European Journal of Operational Research	2015-07-29	Paper
Integer programming approaches for minimum stabbing problems RAIRO - Operations Research	2014-05-26	Paper
A distributed transportation simplex applied to a Content Distribution Network problem RAIRO - Operations Research	2014-05-26	Paper
New branch-and-bound algorithms for \(k\)-cardinality tree problems Electronic Notes in Discrete Mathematics	2013-07-23	Paper
A branch-and-cut algorithm for equitable coloring based on a formulation by representatives Electronic Notes in Discrete Mathematics	2013-07-19	Paper
Upper and lower bounding procedures for the minimum caterpillar spanning problem Electronic Notes in Discrete Mathematics	2013-07-19	Paper
The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm Discrete Applied Mathematics	2011-10-27	Paper
A branch-and-price approach for the partition coloring problem Operations Research Letters	2011-08-09	Paper
A branch-and-cut algorithm for partition coloring Networks	2010-11-24	Paper
Cliques, holes and the vertex coloring polytope Information Processing Letters	2009-07-09	Paper

Research outcomes over time

This page was built for person: Y. Frota