Search
Now showing items 11-20 of 46
A branch and cut algorithm for the hierarchical network design problem
(ELSEVIER SCIENCE BV, 2010)
The Hierarchical Network Design Problem consists of locating a minimum cost bi-level network on a graph. The higher level sub-network is a path visiting two or more nodes. The lower level sub-network is a forest connecting ...
A Branch-and-cut Algorithm For A Class Of Sum-of-ratios Problems
(ELSEVIER SCIENCE INCNEW YORK, 2015)
A BRANCH AND CUT ALGORITHM FOR SHEDULING THE HIGHLY-CONSTRAINED CHILEAN SOCCER TOURNAMENT
(SPRINGER, 2007)
The qualifying phase of the Chilean soccer championship follows the structure of a compact single round robin tournament. Good schedules are of major importance for the success of the tournament, making them more balanced, ...
Applications of integer Programming and decomposition to Scheduling Problems: the Strategic Mine Planning Problem and the Bin Packing Problem with Time Lag
(2020)
In scheduling problems, the goal is to assign time slots to a set of activities. In these problems, there are typically precedence constraints between
activities that dictate the order in which they can be carried out and ...
Formulações e algoritmos sequenciais e paralelos para o problema da árvore geradora de custo mínimo com restrição de grau mínimo
(Universidade Federal de Minas GeraisUFMG, 2012-02-13)
Given an edge weighted undirected graph G and a positive integer d, the Min-degree Constrained Minimum Spanning Tree Problem (MDMST) consists of finding a minimum cost spanning tree T of G, such that each vertex is either ...
Algorithms for bi-level optimization in retail: pricing, assortment and demand coordination
(2021)
This dissertation focuses on extensions of product line optimization modeling. Retail stores are
faced with many decisions to optimize the process of satisfying customer demand. Thanks to
current technologies, they can ...