Marcus Poggi de Aragão

Orcid: 0000-0003-0827-7111

According to our database1, Marcus Poggi de Aragão authored at least 62 papers between 1990 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Regularization and Global Optimization in Model-Based Clustering.
CoRR, 2023

On the Automatic Generation of Knowledge Connections.
Proceedings of the 25th International Conference on Enterprise Information Systems, 2023

Binary Matrix Factorization Discretization.
Proceedings of the Artificial Intelligence and Soft Computing, 2023

2022
Vehicle Routing with Stochastic Demands and Partial Reoptimization.
Transp. Sci., 2022

FuSS: Fusing Superpixels for Improved Segmentation Consistency.
CoRR, 2022

Deep Open-Set Segmentation in Visual Learning.
Proceedings of the 35th SIBGRAPI Conference on Graphics, Patterns and Images, 2022

Conditional Reconstruction for Open-Set Semantic Segmentation.
Proceedings of the 2022 IEEE International Conference on Image Processing, 2022

2020
DASRS Rest: Um Algoritmo Eficiente de Detecção de Anomalias em Tempo Real para Data Centers.
Proceedings of the XXXVIII Brazilian Symposium on Computer Networks and Distributed Systems, 2020


Toward an Efficient Real-Time Anomaly Detection System for Cloud Datacenters.
Proceedings of the 2020 IFIP Networking Conference, 2020

An Efficient Matheuristic for the Inventory Routing Problem.
Proceedings of the Combinatorial Optimization - 6th International Symposium, 2020


2019
Two-Dimensional Phase Unwrapping via Balanced Spanning Forests.
INFORMS J. Comput., 2019

Time-consistent risk-constrained dynamic portfolio optimization with transactional costs and time-dependent returns.
Ann. Oper. Res., 2019

Towards a Technique for Extracting Relational Actors from Monolithic Applications.
Proceedings of the 34th Brazilian Symposium on Databases, 2019

2018
The minimum distance superset problem: formulations and algorithms.
J. Glob. Optim., 2018

2D-Phase Unwrapping via Balanced Spanning Forests.
CoRR, 2018

Visual Support to Filtering Cases for Process Discovery.
Proceedings of the 20th International Conference on Enterprise Information Systems, 2018

Visual Filtering Tools and Analysis of Case Groups for Process Discovery.
Proceedings of the Enterprise Information Systems - 20th International Conference, 2018

2017
Limited memory Rank-1 Cuts for Vehicle Routing Problems.
Oper. Res. Lett., 2017

Improved branch-cut-and-price for capacitated vehicle routing.
Math. Program. Comput., 2017

New benchmark instances for the Capacitated Vehicle Routing Problem.
Eur. J. Oper. Res., 2017

A more human-like portfolio optimization approach.
Eur. J. Oper. Res., 2017

2015
A Computational Study of Conflict Graphs and Aggressive Cut Separation in Integer Programming.
Electron. Notes Discret. Math., 2015

Adaptive Automated Storytelling Based on Audience Response.
Proceedings of the Entertainment Computing - ICEC 2015 - 14th International Conference, 2015

2014
Efficient elementary and restricted non-elementary route pricing.
Eur. J. Oper. Res., 2014

New Exact Algorithms for the Capacitated Vehicle Routing Problem.
Proceedings of the Vehicle Routing, 2014

2013
Harvest planning in the Brazilian sugar cane industry via mixed integer programming.
Eur. J. Oper. Res., 2013

Improved bounds for large scale capacitated arc routing problem.
Comput. Oper. Res., 2013

Cascading Knapsack Inequalities: reformulation of a crude oil distribution problem.
Ann. Oper. Res., 2013

2012
A linear time approximation algorithm for permutation flow shop scheduling.
Theor. Comput. Sci., 2012

2011
A Branch-Cut-and-Price Algorithm for the Capacitated Arc Routing Problem.
Proceedings of the Experimental Algorithms - 10th International Symposium, 2011

2010
Improved lower bounds for the Split Delivery Vehicle Routing Problem.
Oper. Res. Lett., 2010

Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems.
Math. Program. Comput., 2010

Optimizing Helicopter Transport of Oil Rig Crews at Petrobras.
Interfaces, 2010

Bounds for short covering codes and reactive tabu search.
Discret. Appl. Math., 2010

The Team Orienteering Problem: Formulations and Branch-Cut and Price.
Proceedings of the ATMOS 2010, 2010

2009
A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem.
Networks, 2009

Petroleum allocation at PETROBRAS: Mathematical model and a solution algorithm.
Comput. Chem. Eng., 2009

2008
Robust branch-cut-and-price for the Capacitated Minimum Spanning Tree problem over a large extended formulation.
Math. Program., 2008

2006
Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Math. Program., 2006

Solving capacitated arc routing problems using a transformation to the CVRP.
Comput. Oper. Res., 2006

Column Generation Based Heuristic for a Helicopter Routing Problem.
Proceedings of the Experimental Algorithms, 5th International Workshop, 2006

2005
Stabilized branch-and-cut-and-price for the generalized assignment problem.
Electron. Notes Discret. Math., 2005

2004
A hybrid approach for searching in the semantic web.
Proceedings of the 13th international conference on World Wide Web, 2004

Integrating Semantic Concept Similarity in Model-Based Web Applications.
Proceedings of the Joint Conference 10th Brazilian Symposium on Multimedia and the Web & 2nd Latin American Web Congress, 2004

Robust Branch-and-Cut-and-Price for the Capacitated Vehicle Routing Problem.
Proceedings of the Integer Programming and Combinatorial Optimization, 2004

2002
Preprocessing Steiner problems from VLSI layout.
Networks, 2002

Solving the Freight Car Flow Problem to Optimality.
Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002

On the Implementation of MST-Based Heuristics for the Steiner Problem in Graphs.
Proceedings of the Algorithm Engineering and Experiments, 4th International Workshop, 2002

2001
Vertex-Disjoint Packing of Two Steiner Trees: polyhedra and branch-and-cut.
Math. Program., 2001

Dual Heuristics on the Exact Solution of Large Steiner Problems.
Electron. Notes Discret. Math., 2001

2000
Probabilistic satisfiability with imprecise probabilities.
Int. J. Approx. Reason., 2000

Two Approaches for Pay-per-Use Software Construction.
Proceedings of the Second International Workshop on Advance Issues of E-Commerce and Web-Based Information Systems (WECWIS 2000), 2000

1999
The gamma-connected assignment problem.
Eur. J. Oper. Res., 1999

1998
Mixed-integer column generation algorithms and the probabilistic maximum satisfiability problem.
Eur. J. Oper. Res., 1998

1995
Boole's Conditions of Possible Experience and Reasoning under Uncertainty.
Discret. Appl. Math., 1995

Models and Algorithms for Probabilistic and Bayesian Logic.
Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, 1995

1994
Local Optima Topology for the <i>k</i>-Coloring Problem.
Discret. Appl. Math., 1994

1991
Hyperbolic 0-1 programming and query optimization in information retrieval.
Math. Program., 1991

Column Generation Methods for Probabilistic Logic.
INFORMS J. Comput., 1991

1990
Boolean Query Optimization and the 0-1 Hyperbolic Sum Problem.
Ann. Math. Artif. Intell., 1990


  Loading...