The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Enrico Angelelli" ( http://dblp.L3S.de/Authors/Enrico_Angelelli )

  Author page on DBLP  Author page in RDF  Community of Enrico Angelelli in ASPL-2

Publication years (Num. hits)
2002-2011 (13)
Publication types (Num. hits)
article(12) inproceedings(1)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 9 occurrences of 8 keywords

Results
Found 13 publication records. Showing 13 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Enrico Angelelli, Carlo Filippi On the complexity of interval scheduling with a resource constraint. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Enrico Angelelli, Renata Mansini, Michele Vindigni Look-ahead heuristics for the dynamic traveling purchaser problem. Search on Bibsonomy Computers & OR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Enrico Angelelli, Maria Grazia Speranza, József Szoldatics, Zsolt Tuza Geometric representation for semi on-line scheduling on uniform processors. Search on Bibsonomy Optimization Methods and Software The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Enrico Angelelli, Renata Mansini, Maria Grazia Speranza Kernel search: A general heuristic for the multi-dimensional knapsack problem. Search on Bibsonomy Computers & OR The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Enrico Angelelli, Nicola Bianchessi, Renata Mansini, Maria Grazia Speranza Comparison of policies in dynamic routing problems. Search on Bibsonomy JORS The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Enrico Angelelli, Sergio Ortobelli Lozza Maximum Expected Utility of Markovian Predicted Wealth. Search on Bibsonomy ICCS The full citation details ... 2009 DBLP  DOI  BibTeX  RDF portfolio strategies, computational complexity, heuristic, Markov chains, expected utility
1Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza Semi-online scheduling on two uniform processors. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Enrico Angelelli, Martin W. P. Savelsbergh, Maria Grazia Speranza Competitive analysis of a dispatch policy for a dynamic multi-period routing problem. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Enrico Angelelli, Maria Grazia Speranza, Martin W. P. Savelsbergh Competitive analysis for dynamic multiperiod uncapacitated routing problems. Search on Bibsonomy Networks The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza New bounds and algorithms for on-line scheduling: two identical processors, known sum and upper bound on the tasks. Search on Bibsonomy Discrete Mathematics & Theoretical Computer Science The full citation details ... 2006 DBLP  BibTeX  RDF
1Enrico Angelelli, Á. B. Nagy, Maria Grazia Speranza, Zsolt Tuza The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks. Search on Bibsonomy J. Scheduling The full citation details ... 2004 DBLP  DOI  BibTeX  RDF competitive analysis, parallel processors, on-line scheduling
1Enrico Angelelli, Maria Grazia Speranza, Zsolt Tuza Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items. Search on Bibsonomy Algorithmica The full citation details ... 2003 DBLP  DOI  BibTeX  RDF Two parallel processors, Semi-on-line, Scheduling, Competitive analysis
1Enrico Angelelli, Maria Grazia Speranza The periodic vehicle routing problem with intermediate facilities. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #13 of 13 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.