Browsing by Author "XX676755"

Now showing items 1-20 of 29

    • Algorithms for clique-independent sets on subclasses of circular-arc graphs 
      Durán Maggiolo, Guillermo; Lin, Min Chih; Mera, Sergio; Szwarcfiter, Jayme Luiz (ELSEVIER, 2006-08-15)
      A circular-arc graph is the intersection graph of arcs on a circle. A Helly circular-arc graph is a circular-arc graph admitting a model whose arcs satisfy the Helly property. A clique-independent set of a graph is a set ...
    • An approach for efficient ship routing 
      Romero, Gonzalo; Durán Maggiolo, Guillermo; Marenco, Javier; Weintraub Pohorille, Andrés (John Wiley & Sons, 2013)
      Ship routing problems are a particular kind of routing problems where the vehicles to be routed are vessels or ships, usually in maritime environments. In contrast to land routing, ship routing has unique features, including ...
    • Asignación de Árbitros para un Campeonato de Fútbol Mediante el Uso de Programación Matemática 
      Alarcón Lorca, Fernando Esteban (Universidad de Chile, 2009)
      La gestión en deportes es una creciente y muy fértil área para aplicaciones de Gestión de Operaciones. Dentro de una liga deportiva existen múltiples factores económicos y logísticos que la transforman en un interesante ...
    • Coordinated graphs and clique graphs of clique-Helly perfect graphs 
      Bonomo, Flavia; Durán Maggiolo, Guillermo; Groshaus, Marina (2007)
      A new class of graphs related to perfect graphs is defined in this work: coordinated graphs. A graph G is coordinated if the cardinality of a maximum set of cliques of H with a common vertex is equal to the cardinality of ...
    • Etiquetamiento de Grafos: Flujos y Coloreamiento Inducido de Aristas 
      Zamora Ponce, José Tomás (Universidad de ChilePrograma Cybertesis, 2008)
    • Forbidden subgraphs and the König–Egerváry property 
      Bonomo, Flavia; Dourado, Mitre C.; Durán Maggiolo, Guillermo; Faria, Luerbio; Grippo, Luciano N.; Safe, Martín D. (Elsevier, 2013)
      The matching number of a graph is the maximum size of a set of vertex-disjoint edges. The transversal number is the minimum number of vertices needed to meet every edge. A graph has the König–Egerváry property if its ...
    • Manejo de Inventarios en una Cadena de Supermercado 
      Naranjo de Lucca, María Luisa (Universidad de ChilePrograma Cybertesis, 2006)
    • Mathematical models for optimizing production chain planning in salmon farming 
      Bravo, Fernanda; Durán Maggiolo, Guillermo; Lucena, Abilio; Marenco, Javier; Morán, Diego; Weintraub Pohorille, Andrés (John Wiley, 2013)
      The salmon farming production chain is structured in four consecutive phases: freshwater, seawater, plant processing, and distribution and marketing. The phases interact in a pull manner, freshwater stocks fish to meet ...
    • Métodos Cuantitativos para Configuración de Unidades Territoriales Aplicado a JUNAEB 
      Zamorano Valenzuela, Gonzalo Andrés (Universidad de Chile, 2008)
      JUNAEB, Junta Nacional de Auxilio Escolar y Becas, es un organismo gubernamental que tiene como misión ayudar a los niños y jóvenes con alta vulnerabilidad bio-psico-social a su inserción y mantención en el mundo escolar. ...
    • Minimum sum set coloring of trees and line graphs of trees 
      Bonomo, Flavia; Durán Maggiolo, Guillermo; Marenco, Javier; Valencia Pabon, Mario (Elsevier, 2011)
      In this paper, we study the minimum sum set coloring (MSSC) problem which consists in assigning a set of x(v) positive integers to each vertex v of a graph so that the intersection of sets assigned to adjacent vertices ...
    • Modelo para la Planificación de la Producción en la Cadena Productiva del Salmón, Etapa Agua Dulce 
      Bravo Plaza, María Fernanda (Universidad de ChilePrograma Cybertesis, 2009)
    • Modelos de Programación Matemática para Asignación de Pabellones Quirúrgicos en Hospitales Públicos 
      Wolff Rojas, Patricio (Universidad de ChileCyberDocs, 2012)
      La programación de las actividades quirúrgicas en un centro médico es un proceso muy complejo. La elección de los horarios y la asignación de recursos impactan directamente en el número de pacientes tratados y en el nivel ...
    • Modelos de simulación y asignación de personal para manejo de equipajes en un aeropuerto internacional 
      Cavada Herrera, Juan Pablo (Universidad de Chile, 2013)
      El Aeropuerto Internacional Arturo Merino Benítez superó en el año 2010 la capacidad de pasajeros para el que fue diseñado, provocando que los sistemas del terminal deban operar bajo un nivel de estrés sin precedentes. ...
    • NP-completeness results for edge modification problems 
      Burzyn, Pablo; Bonomo, Flavia; Durán Maggiolo, Guillermo (ELSEVIER, 2006-08-15)
      The aim of edge modification problems is to change the edge set of a given graph as little as possible in order to satisfy a certain property. Edge modification problems in graphs have a lot of applications in different ...
    • On balanced graphs 
      Bonomo, Flavia; Durán Maggiolo, Guillermo; Lin, Min Chih; Szwarcfiter, Jayme L. (SPRINGER, 2006-02)
      Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph to be balanced when its clique matrix is balanced. Characterizations of balanced ...
    • On minimal forbidden subgraph characterizations of balanced graphs 
      Bonomo, Flavia; Durán Maggiolo, Guillermo; Safe, Martín D.; Wagler, Annegret K. (2013)
      A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordless cycle as a submatrix. While a forbidden induced subgraph characterization of balanced graphs is known, there is no ...
    • On probe 2-clique graphs and probe diamond-free graphs 
      Bonomo, Flavia; Figueiredo, Celina de; Durán Maggiolo, Guillermo; Grippo, Luciano; Safe, Martín; Szwarcfiter, Jayme (Discrete Mathematics and Theoretical Computer Science, 2015)
      Given a class G of graphs, probe G graphs are defined as follows. A graph G is probe G if there exists a partition of its vertices into a set of probe vertices and a stable set of nonprobe vertices in such a way that ...
    • A one-to-one correspondence between potential solutions ofthe cluster deletion problem and the minimum sum ... 
      Bonomo, Flavia; Durán Maggiolo, Guillermo; Napoli, Amedeo; Valencia Pabon, Mario (Elsevier, 2015)
      In this note we show a one-to-one correspondence between potentially optimal solutions to the cluster deletion problem in a graph Gand potentially optimal solutions for the minimum sum coloring problem in G(i.e. the ...
    • Partial characterizations of clique-perfect graphs I: Subclasses of claw-free graphs 
      Bonomo, Flavia; Chudnovsky, Maria; Durán Maggiolo, Guillermo (ELSEVIER, 2008-04-01)
      A clique-transversal of a graph G is a subset of vertices that meets all the cliques of G. A clique-independent set is a collection of pairwise vertex-disjoint cliques. The clique-transversal number and clique-independence ...
    • Planificación de la Producción en Agua-Mar de una Empresa Salmonera de Puerto Montt Usando Programación ... 
      Morán Ramírez, Diego Alejandro (Universidad de Chile, 2009)
      En este trabajo nos concentramos en optimizar el proceso de la planificación de la producción en la etapa de agua-mar en una empresa salmonera. La planificación de la producción en agua-mar consiste en programar las ...