In this paper, constraint and integer programming formulations are applied to solve Bandwidth Col... more In this paper, constraint and integer programming formulations are applied to solve Bandwidth Coloring Problem (BCP) and Bandwidth Multicoloring Problem (BMCP). The problems are modeled using distance geometry (DG) approaches, which are then used to construct the constraint programming formulation. The integer programming formulation is based on a previous formulation for the related Minimum Span Frequency Assignment Problem (MSFAP), which is modified in order to reduce its size and computation time. The two exact approaches are implemented with available solvers and applied to well-known sets of instances from the literature, GEOM and Philadelphia-like problems. Using these models, some heuristic solutions from previous works are proven to be optimal, a new upper bound for an instance is given and all optimal solutions for the Philadelphia-like problems are presented. A discussion is also made on the performance of constraint and integer programming for each considered coloring pro...
Anais do Encontro de Teoria da Computação (ETC), 2018
Neste trabalho, apresenta-se o modelo baseado em distâncias para o problema clássico de coloração... more Neste trabalho, apresenta-se o modelo baseado em distâncias para o problema clássico de coloração de vértices em grafos (VCP). A formulação de programação linear inteira utiliza variáveis de decisão que representam a distância entre cores atribuídas para cada par de vértices distintos, no lugar de fornecer explicitamente tais cores. Mostra-se que há uma relação próxima entre esta formulação e o modelo baseado em orientação para o VCP, proposto também pelos autores deste trabalho. Em particular, prova-se que desigualdades indutoras de facetas para o modelo baseado em orientação podem ser traduzidas em desigualdades indutoras de facetas para o modelo baseado em distâncias e vice-versa.
One of the most important combinatorial optimization problems is graph coloring. There are severa... more One of the most important combinatorial optimization problems is graph coloring. There are several variations of this problem involving additional constraints either on vertices or edges. They constitute models for real applications, such as channel assignment in mobile wireless networks. In this work, we consider some coloring problems involving distance constraints as weighted edges, modeling them as distance geometry problems. Thus, the vertices of the graph are considered as embedded on the real line and the coloring is treated as an assignment of positive integers to the vertices, while the distances correspond to line segments, where the goal is to find a feasible intersection of them. We formulate different such coloring problems and show feasibility conditions for some problems. We also propose implicit enumeration methods for some of the optimization problems based on branch-and-prune methods proposed for distance geometry problems in the literature. An empirical analysis w...
Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks, 2000
Page 1. A hybrid genetic algorithm for finding stable conformations of small molecules HJC Barbos... more Page 1. A hybrid genetic algorithm for finding stable conformations of small molecules HJC Barbosa and FMP Raupp Laboratbrio Nacional de Computa@o Cientifica ... D. Whitley, Morgan Kaufmann, San Mateo, CA (1993), pp. 187-202. ...
1 Systems Engineering and Computer Science Program UFRJ Rio de Janeiro, Brazil 2 Institute of... more 1 Systems Engineering and Computer Science Program UFRJ Rio de Janeiro, Brazil 2 Institute of Computing University of Campinas, Campinas, Brazil 3 Department of Informatics PUC-Rio Rio de Janeiro, Brazil ... This paper introduces the Brazilian Institute for ...
In this work we present an enumerative scheme for determining the K-best solutions (K > 1) of ... more In this work we present an enumerative scheme for determining the K-best solutions (K > 1) of the one dimensional knapsack problem. If n is the total number of different items and b is the knapsack's capacity, the computational complexity of the proposed scheme is bounded by O(Knb) with memory requirements bounded by O(nb). The algorithm was implemented in a workstation and computational tests for varying values of the parameters were performed.
This paper presents a strategy to design a Demand Side Management in the Brazilian energy market,... more This paper presents a strategy to design a Demand Side Management in the Brazilian energy market, using stochastic optimization and price elasticity of demand. This paper evaluates the proxy value for triggering the Incentive-based program of Demand Response (DR) in a Brazilian utility company. Then, the results show the proxy values for three types of customers, regarding the deficit scenarios. Also, the Value of Stochastic Solution proves the impact of the cost of ignoring uncertainty in designing this DR program.
In this paper, constraint and integer programming formulations are applied to solve Bandwidth Col... more In this paper, constraint and integer programming formulations are applied to solve Bandwidth Coloring Problem (BCP) and Bandwidth Multicoloring Problem (BMCP). The problems are modeled using distance geometry (DG) approaches, which are then used to construct the constraint programming formulation. The integer programming formulation is based on a previous formulation for the related Minimum Span Frequency Assignment Problem (MSFAP), which is modified in order to reduce its size and computation time. The two exact approaches are implemented with available solvers and applied to well-known sets of instances from the literature, GEOM and Philadelphia-like problems. Using these models, some heuristic solutions from previous works are proven to be optimal, a new upper bound for an instance is given and all optimal solutions for the Philadelphia-like problems are presented. A discussion is also made on the performance of constraint and integer programming for each considered coloring pro...
Anais do Encontro de Teoria da Computação (ETC), 2018
Neste trabalho, apresenta-se o modelo baseado em distâncias para o problema clássico de coloração... more Neste trabalho, apresenta-se o modelo baseado em distâncias para o problema clássico de coloração de vértices em grafos (VCP). A formulação de programação linear inteira utiliza variáveis de decisão que representam a distância entre cores atribuídas para cada par de vértices distintos, no lugar de fornecer explicitamente tais cores. Mostra-se que há uma relação próxima entre esta formulação e o modelo baseado em orientação para o VCP, proposto também pelos autores deste trabalho. Em particular, prova-se que desigualdades indutoras de facetas para o modelo baseado em orientação podem ser traduzidas em desigualdades indutoras de facetas para o modelo baseado em distâncias e vice-versa.
One of the most important combinatorial optimization problems is graph coloring. There are severa... more One of the most important combinatorial optimization problems is graph coloring. There are several variations of this problem involving additional constraints either on vertices or edges. They constitute models for real applications, such as channel assignment in mobile wireless networks. In this work, we consider some coloring problems involving distance constraints as weighted edges, modeling them as distance geometry problems. Thus, the vertices of the graph are considered as embedded on the real line and the coloring is treated as an assignment of positive integers to the vertices, while the distances correspond to line segments, where the goal is to find a feasible intersection of them. We formulate different such coloring problems and show feasibility conditions for some problems. We also propose implicit enumeration methods for some of the optimization problems based on branch-and-prune methods proposed for distance geometry problems in the literature. An empirical analysis w...
Proceedings. Vol.1. Sixth Brazilian Symposium on Neural Networks, 2000
Page 1. A hybrid genetic algorithm for finding stable conformations of small molecules HJC Barbos... more Page 1. A hybrid genetic algorithm for finding stable conformations of small molecules HJC Barbosa and FMP Raupp Laboratbrio Nacional de Computa@o Cientifica ... D. Whitley, Morgan Kaufmann, San Mateo, CA (1993), pp. 187-202. ...
1 Systems Engineering and Computer Science Program UFRJ Rio de Janeiro, Brazil 2 Institute of... more 1 Systems Engineering and Computer Science Program UFRJ Rio de Janeiro, Brazil 2 Institute of Computing University of Campinas, Campinas, Brazil 3 Department of Informatics PUC-Rio Rio de Janeiro, Brazil ... This paper introduces the Brazilian Institute for ...
In this work we present an enumerative scheme for determining the K-best solutions (K > 1) of ... more In this work we present an enumerative scheme for determining the K-best solutions (K > 1) of the one dimensional knapsack problem. If n is the total number of different items and b is the knapsack's capacity, the computational complexity of the proposed scheme is bounded by O(Knb) with memory requirements bounded by O(nb). The algorithm was implemented in a workstation and computational tests for varying values of the parameters were performed.
This paper presents a strategy to design a Demand Side Management in the Brazilian energy market,... more This paper presents a strategy to design a Demand Side Management in the Brazilian energy market, using stochastic optimization and price elasticity of demand. This paper evaluates the proxy value for triggering the Incentive-based program of Demand Response (DR) in a Brazilian utility company. Then, the results show the proxy values for three types of customers, regarding the deficit scenarios. Also, the Value of Stochastic Solution proves the impact of the cost of ignoring uncertainty in designing this DR program.
Uploads
Papers by N. Maculan