|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 15 publication records. Showing 15 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gérard Cornuéjols, Carla Michini, Giacomo Nannicini |
How tight is the corner relaxation? Insights gained from the stable set problem.  |
Discrete Optimization  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Giacomo Nannicini, Daniel Delling, Dominik Schultes, Leo Liberti |
Bidirectional A* search on time-dependent road networks. |
Networks |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini |
Improved strategies for branching on general disjunctions. |
Math. Program. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Giacomo Nannicini, Gérard Cornuéjols, Miroslav Karamanov, Leo Liberti |
Branching on Split Disjunctions. |
Combinatorial Optimization - Methods and Applications |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, François Margot, Andreas Wächter |
A Probing Algorithm for MINLP with Failure Prediction by SVM. |
CPAIOR |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Giacomo Nannicini |
Point-to-point shortest paths on dynamic time-dependent road networks. |
4OR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Leo Liberti, Giacomo Nannicini, Nenad Mladenovic |
A Good Recipe for Solving MINLPs. |
Matheuristics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard Cornuéjols, Leo Liberti, Giacomo Nannicini |
Improved Strategies for Branching on General Disjunctions. |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Sonia Cafieri, Antonio Mucherino, Giacomo Nannicini, Fabien Tarissan, Leo Liberti (eds.) |
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2009, Paris, France, June 2-4 2009 |
CTW |
2009 |
DBLP BibTeX RDF |
|
| 1 | Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes |
Bidirectional A* Search for Time-Dependent Fast Paths. |
WEA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti |
Fast Computation of Point-to-Point Paths on Time-Dependent Road Networks. |
COCOA |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Giacomo Nannicini, Daniel Delling, Leo Liberti, Dominik Schultes |
Bidirectional A* on Time-dependent Graphs. |
CTW |
2008 |
DBLP BibTeX RDF |
|
| 1 | Daniel Delling, Giacomo Nannicini |
Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. |
ISAAC |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Giacomo Nannicini, Philippe Baptiste, Gilles Barbier, Daniel Krob, Leo Liberti |
Fast paths in large-scale dynamic road networks |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Giacomo Nannicini, Philippe Baptiste, Daniel Krob, Leo Liberti |
Fast point-to-point shortest path queries on dynamic road networks with interfal data. |
CTW |
2007 |
DBLP BibTeX RDF |
|
Displaying result #1 - #15 of 15 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")