The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Alexandre Salles da Cunha" ( http://dblp.L3S.de/Authors/Alexandre_Salles_da_Cunha )

  Author page on DBLP  Author page in RDF  Community of Alexandre Salles da Cunha in ASPL-2

Publication years (Num. hits)
2005-2011 (18)
Publication types (Num. hits)
article(14) inproceedings(4)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 4 occurrences of 4 keywords

Results
Found 18 publication records. Showing 18 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha A Branch-and-price algorithm for a Vehicle Routing Problem with Cross-Docking. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Dilson Lucas Pereira, Alexandre Salles da Cunha, Geraldo Robson Mateus Stronger column generation bounds for the Minimum Cost Hop-and-root Constrained Forest Problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Wagner Moro Aioffi, Cristiano Arbex Valle, Geraldo Robson Mateus, Alexandre Salles da Cunha Balancing message delivery latency and network lifetime through an integrated model for clustering and routing in Wireless Sensor Networks. Search on Bibsonomy Computer Networks The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Cristiano Arbex Valle, Leonardo Conegundes Martinez, Alexandre Salles da Cunha, Geraldo Robson Mateus Heuristic and exact algorithms for a min-max selective vehicle routing problem. Search on Bibsonomy Computers & OR 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
1Fernando Afonso Santos, Geraldo Robson Mateus, Alexandre Salles da Cunha A Novel Column Generation Algorithm for the Vehicle Routing Problem with Cross-Docking. 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
1Leonardo Conegundes Martinez, Alexandre Salles da Cunha Finding min-degree constrained spanning trees faster with a Branch-and-cut algorithm. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Alexandre Salles da Cunha, Laura Bahiense, Abilio Lucena, Cid Carvalho de Souza A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus, Abilio Lucena The k-Cardinality Tree Problem: Reformulations and Lagrangian Relaxation. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Carla Bechelane, Alexandre Salles da Cunha, Geraldo Robson Mateus The Minimum Cost Hop-and-root constrained forest in Wireless Sensor Networks. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Cristiano Arbex Valle, Alexandre Salles da Cunha, Geraldo Robson Mateus, Leonardo C. Martinez Exact algorithms for a selective Vehicle Routing Problem where the longest route is minimized. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Alexandre Salles da Cunha, Abilio Lucena, Nelson Maculan, Mauricio G. C. Resende A relax-and-cut algorithm for the prize-collecting Steiner problem in graphs. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Alexandre Salles da Cunha, Maurício Cardoso de Souza Stronger upper and lower bounds for a hard batching problem to feed assembly lines. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Frederico Paiva Quintão, Alexandre Salles da Cunha, Geraldo Robson Mateus Integer Programming Formulations for the k-Cardinality Tree Problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Cristiano Arbex Valle, Alexandre Salles da Cunha, Wagner Moro Aioffi, Geraldo Robson Mateus Algorithms for improving the quality of service in wireless sensor networks with multiple mobile sinks. Search on Bibsonomy MSWiM The full citation details ... 2008 DBLP  DOI  BibTeX  RDF message delivery delay, simulation, wireless sensor networks, metaheuristics, mobile sink
1Alexandre Salles da Cunha, Abilio Lucena Lower and upper bounds for the degree-constrained minimum spanning tree problem. Search on Bibsonomy Networks The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Alexandre Salles da Cunha, Abilio Lucena Algorithms for the degree-constrained minimum spanning tree problem. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #18 of 18 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.