Výsledky vyhledávání - "Assunção, Lucas"

Report

Coupling Feasibility Pump and Large Neighborhood Search to solve the Steiner team orienteering problem

Autor: Assunção, Lucas, Mateus, Geraldo Robson

The Steiner Team Orienteering Problem (STOP) is defined on a digraph in which arcs are associated with traverse times, and whose vertices are labeled as either mandatory or profitable, being the latter provided with rewards (profits). Given a homogen

Externí odkaz: http://arxiv.org/abs/2101.01530

Zobrazit plný text záznamu

Report

On the Finite Optimal Convergence of Logic-Based Benders' Decomposition in Solving 0-1 Min-max Regret Optimization Problems with Interval Costs

Autor: Assunção, Lucas, Santos, Andréa Cynthia, Noronha, Thiago F., Andrade, Rafael

Publikováno v: Proceedings of the International Symposium on Combinatorial Optimization (ISCO) 2016: Lecture Notes in Computer Science, vol 9849. Combinatorial Optimization pp 1-12. Springer, Cham

This paper addresses a class of problems under interval data uncertainty composed of min-max regret versions of classical 0-1 optimization problems with interval costs. We refer to them as interval 0-1 min-max regret problems. The state-of-the-art ex

Externí odkaz: http://arxiv.org/abs/2001.00943

Zobrazit plný text záznamu

Report

A cutting-plane algorithm for the Steiner team orienteering problem

Autor: Assunção, Lucas, Mateus, Geraldo Robson

Publikováno v: Computers & Industrial Engineering, Volume 135, September 2019, Pages 922-939

The Team Orienteering Problem (TOP) is an NP-hard routing problem in which a fleet of identical vehicles aims at collecting rewards (prizes) available at given locations, while satisfying restrictions on the travel times. In TOP, each location can be

Externí odkaz: http://arxiv.org/abs/2001.00858

Zobrazit plný text záznamu

Akademický článek

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Report

A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs

Autor: Assunção, Lucas, Noronha, Thiago F., Santos, Andréa Cynthia, Andrade, Rafael

This work deals with a class of problems under interval data uncertainty, namely interval robust-hard problems, composed of interval data min-max regret generalizations of classical NP-hard combinatorial problems modeled as 0-1 integer linear program

Externí odkaz: http://arxiv.org/abs/1609.09179

Zobrazit plný text záznamu