CTW C

74 papers

YearTitle / Authors
2009A Branch-and-Price Approach for the Partition Coloring Problem.
Edna Ayako Hoshino, Yuri Frota, Cid C. de Souza
2009A Lower Bound for the Cutting Stock Problem with a Limited Number of Open Stacks.
Claudio Arbib, Fabrizio Marinelli, Carlo M. Scoppola
2009A Note on the Parameterized Complexity of the Maximum Independent Set Problem.
Vadim V. Lozin
2009A Polynomial-Time Recursive Algorithm for some Unconstrained Quadratic Optimization Problems.
Walid Ben-Ameur, José Neto
2009A Replacement Model for a Scale-Free Property of Cliques.
Takeya Shigezumi, Yushi Uno, Osamu Watanabe
2009A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs.
Stavros D. Nikolopoulos, Charis Papadopoulos
2009A Simple MAX-CUT Algorithm for Planar Graphs.
Frauke Liers, G. Pardella
2009A System-Theoretic Model for Cooperation and Allocation Mechanisms.
Ulrich Faigle, Jan Voss
2009Acyclic and Frugal Colourings of Graphs.
Ross J. Kang, Tobias Müller
2009Acyclic and Star Colorings of Joins of Graphs and an Algorithm for Cographs.
Andrew Lyons
2009Algorithmic Solutions of Discrete Control Problems on Stochastic Networks.
Dmitrii Lozovanu, Stefan Pickl
2009An Exact Algorithm to Minimize the Makespan in Project Scheduling with Scarce Resources and Feeding Precedence Relations.
Lucio Bianco, Massimiliano Caramia
2009An Exact Method for the Minimum Caterpillar Spanning Problem.
Luidi Simonetti, Yuri Frota, Cid C. de Souza
2009Balanced Clustering for Efficient Detection of Scientific Plagiarism.
Alberto Ceselli, Roberto Cordone, Marco Cremonini
2009Bilevel Programming and Maximally Violated Valid Inequalities.
Andrea Lodi, Ted K. Ralphs
2009Bounds and Solutions for Strategic, Tactical and Operational Ambulance Location.
Roberto Cordone, Federico Ficarelli, Giovanni Righini
2009Cardinality Constrained Graph Partitioning into Cliques with Submodular Costs.
José R. Correa, Nicole Megow, Rajiv Raman, Karol Suchan
2009Classification of 0/1-Facets of the Hop Constrained Path Polytope Defined on an Acyclic Digraph.
Rüdiger Stephan
2009Colored Independent Sets.
Jens Maßberg, Tim Nieberg
2009Colored Resource Allocation Games.
Evangelos Bampas, Aris Pagourtzis, George Pierrakos, Vasileios Syrgkanis
2009Colored Trees in Edge-Colored Graphs.
Abdelfattah Abouelaoualim, Valentin Borozan, Yannis Manoussakis, Carlos A. J. Martinhon, Rahul Muthu, Rachid Saad
2009Column Generation for the Multicommodity Min-cost Flow Over Time Problem.
Enrico Grande, Pitu B. Mirchandani, Andrea Pacifici
2009Combinatorial Optimization Based Recommender Systems.
Fabio Roda, Leo Liberti, Franco Raimondi
2009Combinatorial Optimization Problems with Conflict Graphs.
Andreas Darmann, Ulrich Pferschy, Joachim Schauer, Gerhard J. Woeginger
2009Decomposition Methods for Stochastic Integer Programs with Dominance Constraints.
Rüdiger Schultz
2009Diameter and Center Computations in Networks.
Michel Habib
2009Distribution of Permanent of Matrices with Restricted Entries over Finite Fields.
Le Anh Vinh
2009Effective Heuristics for Large Euclidean TSP Instances Based on Pseudo Backbones.
Changxing Dong, Christian Ernst, Gerold Jäger, Dirk Richter, Paul Molitor
2009Efficient Algorithms for the Double Traveling Salesman Problem with Multiple Stacks.
Marco Casazza, Alberto Ceselli, Marc Nunkesser
2009Enumerating all Finite Sets of Minimal Prime Extensions of Graphs.
Vassilis Giakoumakis, Cheikh Brahim Ooud El Mounir
2009Exact Algorithms for Vehicle Routing Problems with Different Service Constraints.
Rita Macedo, Cláudio Alves, José M. Valério de Carvalho
2009Exact Exponential-Time Algorithms for Finding Bicliques in a Graph.
Henning Fernau, Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Daniel Raible
2009Extremal Stable Graphs.
Gyula Y. Katona, Illés Horváth
2009Faster Min-Max Resource Sharing and Applications.
Dirk Müller
2009Finding Tight RLT Formulations for Quadratic Semi-Assignment Problems.
Ingmar Schüle, Hendrik Ewe, Karl-Heinz Küfer
2009From Sainte-Laguü to Claude Berge - French Graph Theory in the Twentieth Century.
Harald Gropp
2009Improved Strategies for Branching on General Disjunctions.
Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini
2009Increasing the Edge Connectivity by One in O(lambda_G n^2 log* n) Expected Time.
Michael Brinkmeier
2009Inferring Update Sequences in Boolean Gene Regulatory Networks.
Fabien Tarissan, Camilo La Rota
2009Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2.
Birgit Engels, Sven Oliver Krumke, Rainer Schrader, Christiane Zeck
2009Integer Programming with 2-Variable Equations and 1-Variable Inequalities.
Manuel Bodirsky, Gustav Nordh, Timo von Oertzen
2009Intermediate Trees.
Kathie Cameron, Joanna B. Fawcett
2009Maintenance Resources Allocation on Power Distribution Networks with a Multi-Objective Framework.
Fábio Luiz Usberti, José Federico Vizcaino González, Christiano Lyra Filho, Celso Cavellucci
2009Minimum Sum Set Coloring on some Subclasses of Block Graphs.
Flavia Bonomo, Guillermo Durán, Javier Marenco, Mario Valencia-Pabon
2009NANOCONES - A Classification Result in Chemistry.
Gunnar Brinkmann, Nicolas Van Cleemput
2009NP-Completeness of Determining the Total Chromatic Number of Graphs that do not Contain a Cycle with a Unique Chord.
Raphael Machado, Celina M. H. de Figueiredo
2009On Multi-Agent Knapsack Problems.
Gaia Nicosia, Andrea Pacifici, Ulrich Pferschy
2009On Planar and Directed Multicuts with few Source-Sink Pairs.
Cédric Bentz
2009On Resistance of Graphs.
Petros A. Petrosyan, H. E. Sargsyan
2009On Self-Duality of Branchwidth in Graphs of Bounded Genus.
Ignasi Sau, Dimitrios M. Thilikos
2009On a Two-Stage Stochastic Knapsack Problem with Probabilistic Constraint.
Stefanie Kosuch, Abdel Lisser
2009On the Boundary of Tractability for Nonlinear Discrete Optimization.
Jon Lee
2009On the Complexity of Graph-Based Bounds for the Probability Bounding Problem.
Andrea Scozzari, Fabio Tardella
2009On the Decomposition of Graphs into Offensive k-Alliances.
José M. Sigarreta Almira, Ismael González Yero, Sergio Bermudo, Juan Alberto Rodríguez-Velázquez
2009Optimising Node Coordinates for the Shortest Path Problem.
Mirko Maischberger
2009Packing Paths: Recycling Saves Time.
Henning Fernau, Daniel Raible
2009Partial Characterizations of Circle Graphs.
Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe
2009Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009
Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti
2009Protein Threading.
Guillaume Collet, Rumen Andonov, Nicola Yanev, Jean-François Gibrat
2009Recognition of Reducible Flow Hypergraphs.
André Luiz Pires Guedes, Lilian Markenzon, Luérbio Faria
2009Recognizing Edge-Perfect Graphs: some Polynomial Instances.
Valeria A. Leoni, Maria Patricia Dobson, Graciela L. Nasini
2009Rectangle Packing with Additional Restrictions.
Jens Maßberg, Jan Schneider
2009Robustness in Train Timetabling.
Valentina Cacchiani, Alberto Caprara, Matteo Fischetti
2009Routing and Wavelength Assignment in Optical Networks by Independent Sets in Conflict Graphs.
Lucile Belgacem, Irène Charon, Olivier Hudry
2009Some Infinite Families of Q-Integral Graphs.
Maria Aguieiras A. de Freitas, Nair Maria Maia de Abreu, Renata R. Del-Vecchio
2009The Anonymous Subgraph Problem.
Andrea Bettinelli, Leo Liberti, Franco Raimondi, David Savourey
2009The Molecular Distance Geometry Problem Applied to Protein Conformations.
Antonio Mucherino, Carlile Lavor, Nelson Maculan
2009The Number of Excellent Discrete Morse Functions on Graphs.
Rafael Ayala, Desamparados Fernández-Ternero, José Antonio Vilches
2009The Open Capacitated Arc Routing Problem.
Fábio Luiz Usberti, Paulo Morelato França, André Luiz Morelato França
2009The Parking Warden Tour Problem.
Maurizio Bruglieri, Alberto Colorni, Alessandro Lué
2009The Sliding Shortest Path Algorithms.
Ramesh Bhandari
2009The k-Gear Composition and the Stable Set Polytope.
Anna Galluccio, Claudio Gentile, M. Macina, Paolo Ventura
2009Two Upper Bounds on the Chromatic Number.
María Soto, André Rossi, Marc Sevaux
2009k-Hyperplane Clustering Problem: Column Generation and a Metaheuristic.
Edoardo Amaldi, Stefano Coniglio, Kanika Dhyani