Buscar
Mostrando ítems 1-10 de 86
A weed colonization inspired algorithm for the weighted set cover problem
(Springer Verlag, 2016)
Using the Firefly Optimization Method to Solve the Weighted Set Covering Problem
(Springer Verlag, 2014)
Using the Bee Colony Optimization Method to Solve the Weighted Set Covering Problem
(Springer Verlag, 2014)
Recent metaheuristics for the Weighted Set Covering problem
(National Technical University of Athens, 2014)
Two swarm intelligence algorithms for the Set Covering problem
(SciTePress, 2014)
Quasi-polynomial time approximation schemes for packing and covering problems in planar graphs
(Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018)
We consider two optimization problems in planar graphs. In Maximum Weight Independent Set of Objects we are given a graph G and a family D of objects, each being a
connected subgraph of G with a prescribed weight, and the ...
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
(ELSEVIER SCIENCE BV, 2009)
Let M = (V, E, A) be a mixed graph with vertex set V, edge set E and arc set A. A cycle cover of M is a family C = {C(1), ... , C(k)} of cycles of M such that each edge/arc of M belongs to at least one cycle in C. The ...
The Minmax regret 0-1 integer linear programming problem under interval uncertainty: complexity and heuristics
(Universidade Federal de Minas GeraisBrasilICX - DEPARTAMENTO DE CIÊNCIA DA COMPUTAÇÃOPrograma de Pós-Graduação em Ciência da ComputaçãoUFMG, 2020-01-30)
Minmax regret is a framework to tackle uncertainty in the decision-making process. In this thesis, we investigate minmax regret optimization problems where the coefficient of the variables on the objective function is ...
Maximum Box Problem on Stochastic Points
(2017)
Given a finite set of weighted points in Rd (where there can be negative weights), the
maximum box problem asks for an axis-aligned rectangle (i.e., box) such that the sum
of the weights of the points that it contains is ...