CTW C

71 papers

YearTitle / Authors
2011A Generalized Stochastic Knapsack Problem with Application in Call Admission Control.
Marco Cello, Giorgio Gnecco, Mario Marchese, Marcello Sanguineti
2011A Lagrangian Relaxation Approach for Gene Regulatory Networks.
Roberto Cordone, Guglielmo Lulli
2011A New Feasibility Pump-Like Heuristic for Mixed Integer Problems.
Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2011A Probabilistic Cellular Automata algorithm for the clique problem.
Alexandre Gaudilliere, Antonio Iovanella, Benedetto Scoppola, Elisabetta Scoppola, Massimiliano Viale
2011A hereditary view on efficient domination.
Martin Milanic
2011A partial characterization by forbidden subgraphs of edge path graphs.
Márcia R. Cerioli, Hugo Nobrega, Petrucio Viana
2011A primal algorithm for the minimum weight clique cover problem on a class of claw-free perfect graphs.
Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels
2011A reduction algorithm for the weighted stable set problem in claw-free graphs.
Paolo Nobili, Antonio Sassano
2011An Evolutionary Algorithm for the Multiobjective Risk-Equity Constrained Routing Problem.
Nora Touati Moungla, Dimo Brockhoff
2011Approximability of the Two-Stage Knapsack problem with discretely distributed weights.
Stefanie Kosuch
2011Bicolored independent sets and bicliques.
Jean-François Couturier, Dieter Kratsch
2011Binary Betting Strategies with Optimal Logarithmic Growth.
Kirsten Albrecht, Ulrich Faigle
2011Bipartite finite Toeplitz graphs.
Sara Nicoloso, Ugo Pietropaoli
2011Bound constraints for Point Packing in a Square.
Alberto Costa, Pierre Hansen, Leo Liberti
2011Branch-and-Prune trees with bounded width.
Leo Liberti, Benoît Masson, Carlile Lavor, Antonio Mucherino
2011Bruno Simeone's Work in Clustering.
Pierre Hansen
2011Characterization of classical graph classes by weighted clique graphs.
Flavia Bonomo, Jayme Luiz Szwarcfiter
2011Combined Location and Routing Problems in Drug Distribution.
Alberto Ceselli, Giovanni Righini, Emanuele Tresoldi
2011Computing Derivatives via Compression: An Exact Scheme.
Shahadat Hossain
2011Computing the Grothendieck constant of some graph classes.
Monique Laurent, Antonios Varvitsiotis
2011Computing the differential of a graph.
Sergio Bermudo, Henning Fernau
2011Continuous Reformulations for Zero-one Programming Problems.
Marianna De Santis, Stefano Lucidi, Francesco Rinaldi
2011Control and voting power in complex shareholding networks.
Yves Crama
2011Decomposition of Tutte Polynomial.
Martin Kochol
2011Discounted Markov Decision Processes and Algorithms for Solving Stochastic Control Problem on Networks.
Dmitrii Lozovanu, Stefan Pickl
2011Edge-chromatic sums of regular and bipartite graphs.
Petros A. Petrosyan, Rafael R. Kamalian
2011Effective drawing of proportional symbol maps using GRASP.
Rafael G. Cano, Guilherme Kunigami, Cid C. de Souza, Pedro J. de Rezende
2011Efficient enumeration of optimal and approximate solutions of a scheduling problem.
Sergey Sevastyanov, Bertrand M. T. Lin
2011Enumeration of Labeled Split Graphs and Counts of Important Superclasses.
Vladislav Bína
2011Formulations and heuristics for the k-Piecewise Affine Model Fitting problem.
Edoardo Amaldi, Stefano Coniglio, Leonardo Taccari
2011Generalized row family inequalities for the set covering polyhedron.
Gabriela R. Argiroffo, Annegret K. Wagler
2011Graph sandwich problems.
Martin Charles Golumbic
2011Improved Taxation Rate for Bin Packing Games.
Walter Kern, Xian Qiu
2011Incompatibility graphs and data mining.
Endre Boros, Vincenzo Spinelli, Federica Ricca
2011Infeasible path formulations for the time-dependent TSP with time windows.
Isabel Méndez-Díaz, Juan José Miranda Bront, Paolo Toth, Paula Zabala
2011Labeling of Oriented Planar Graphs.
Tiziana Calamoneri, Blerina Sinaimeri
2011Local Computation of Vertex Colorings.
Thomas Böhme, Jens Schreyer
2011Locally optimal dissimilar paths in road networks.
Stéphanie Vanhove, Veerle Fack
2011Majorization and the minimum number of dominating sets.
Zdzislaw Skupien
2011Matchings in balanced hypergraphs.
Robert Scheidweiler, Eberhard Triesch
2011Minimally 2-connected graphs and colouring problems.
N. Narayanan
2011Modeling and solving aircrafts scheduling problem in ground control.
Ludovica Adacher, Marta Flamini
2011Models and Algorithms for the Bin Packing Problem with Fragile Objects.
Manuel A. Alba Martínez, François Clautiaux, Mauro Dell'Amico, Manuel Iori
2011Network design with SRG based protection.
Bernardetta Addis, Giuliana Carello, Federico Malucelli
2011New Results for the Directed Network Diversion Problem.
Christopher Cullenbine, R. Kevin Wood, Alexandra M. Newman
2011New upper bound for the number of maximal bicliques of a bipartite graph.
Alexandre Albano, Alair Do Lago
2011Odd cyclic surface separators in planar graphs.
Petr A. Golovach, Marcin Kaminski, Dimitrios M. Thilikos
2011On cycle bases with limited edge overlap.
Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi
2011On graph of order-n with the metric dimension n-3.
Suhadi Wido Saputro, Rinovia Simanjuntak, Saladin Uttunggadewa, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman
2011On the Robust Knapsack Problem.
Michele Monaci, Ulrich Pferschy
2011One Minimum-Cost Network Flow Problem to Identify a Graph's Connected Components.
Joanna Bauer
2011Popular Ranking.
Anke van Zuylen, Frans Schalekamp, David P. Williamson
2011Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy, June 14-16, 2011
Ludovica Adacher, Marta Flamini, Gianmaria Leo, Gaia Nicosia, Andrea Pacifici, Veronica Piccialli
2011Range minimization problems in path-facility location on trees.
Justo Puerto, Federica Ricca, Andrea Scozzari
2011Reducing the minimum T-cut problem to polynomial size linear programming.
Rüdiger Stephan
2011Representations of Power Series over Word Algebras.
Ulrich Faigle, Alexander Schönhuth
2011Research work with Bruno Simeone.
Ronald I. Becker
2011Resources and transmission formats allocation in OFDMA networks.
Andrea Abrardo, Marco Belleschi, Paolo Detti
2011Scheduling problems with unreliable jobs and machines.
Alessandro Agnetis, Paolo Detti, Patrick Martineau
2011Searching Circulant Graphs.
Öznur Yasar Diner, Danny Dyer
2011Sensor Network Localization Using Compressed Extended Kalman Filter.
Marco Carli, Federica Pascucci
2011Separating negative and positive points with the minimum number of boxes.
Paolo Serafini
2011Sorting Common Operations to Minimize Tardy Jobs.
Claudio Arbib, Giovanni Felici, Mara Servilio
2011Sparsifying Distance Matrices for Protein-Protein Structure Alignments.
Antonio Mucherino, Inken Wohlers, Gunnar W. Klau, Rumen Andonov
2011The Boat and Barge Problem.
Mette Gamst, Niels Hvidberg Kjeldsen
2011The Pickup and Delivery Problem with Incompatibility Constraints.
Pablo Factorovich, Isabel Méndez-Díaz, Paula Zabala
2011The dynamics of deterministic systems from a hypergraph theoretical point of view.
Luis Miguel Torres, Annegret K. Wagler
2011The gateway location problem for hazardous material transportation.
Maurizio Bruglieri, Paola Cappanera, Maddalena Nonato
2011The impact of the norm on the k-Hyperplane Clustering problem: relaxations, restrictions, approximation factors, and exact formulations.
Stefano Coniglio
2011The maximum labeled clique problem.
Paolo Dell'Olmo, Raffaele Cerulli, Francesco Carrabs
2011The price of equity in the Hazmat.
Fabio Roda, Pierre Hansen, Leo Liberti