Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Luidi Simonetti" ( http://dblp.L3S.de/Authors/Luidi_Simonetti )

  Author page on DBLP  Author page in RDF  Community of Luidi Simonetti in ASPL-2

Publication years (Num. hits)
2009 (2) 2011 (6)
Publication types (Num. hits)
article(4) inproceedings(4)
Venues (Conferences, Journals, ...)
INOC(3) Electronic Notes in Discrete M...(2) CTW(1) Discrete Applied Mathematics(1) Math. Program.(1)
Authors
Luidi Simonetti(8) Cid C. de Souza(4) Yuri Frota(4) Abilio Lucena(2) Alexandre Salles da Cunha(2) Eduardo Uchoa(2) Ali Ridha Mahjoub(1) Fábio Protti(1) Luis Gouveia(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.
Results
Found 8 publication records. Showing 8 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Luidi Simonetti, Fábio Protti, Yuri Frota, Cid C. de Souza New branch-and-bound algorithms for k-cardinality tree problems. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luidi Simonetti, Yuri Frota, Cid C. de Souza The ring-star problem: A new integer programming formulation and a branch-and-cut algorithm. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luis Gouveia, Luidi Simonetti, Eduardo Uchoa Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs. Search on Bibsonomy Math. Program. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Alexandre Salles da Cunha, Luidi Simonetti, Abilio Lucena Formulations and Branch-and-Cut Algorithm for the K-rooted Mini-Max Spanning Forest Problem. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Ali Ridha Mahjoub, Luidi Simonetti, Eduardo Uchoa Hop-Level Flow Formulation for the Hop Constrained Survivable Network Design Problem. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luidi Simonetti, Alexandre Salles da Cunha, Abilio Lucena The Minimum Connected Dominating Set Problem: Formulation, Valid Inequalities and a Branch-and-Cut Algorithm. Search on Bibsonomy INOC The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Luidi Simonetti, Yuri Frota, Cid C. de Souza Upper and lower bounding procedures for the minimum caterpillar spanning problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Luidi Simonetti, Yuri Frota, Cid C. de Souza An Exact Method for the Minimum Caterpillar Spanning Problem. Search on Bibsonomy CTW The full citation details ... 2009 DBLP  BibTeX  RDF
Displaying result #1 - #8 of 8 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.