Enrico Angelelli - Citegraph

Author Info

Name	Affiliation	Papers
ENRICO ANGELELLI	Department of Quantitative Methods, University of Brescia, Brescia, Italy	29
Collaborators	Citations	PageRank
26	291	20.58
Referers	Referees	References
493	386	258

Search Limit

100493

Publications (29 rows)

Collaborators (26 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A matheuristic for the air transportation freight forwarder service problem.	1	0.63	2020
Minimizing the total travel time with limited unfairness in traffic networks.	0	0.34	2020
A trade-off between average and maximum arc congestion minimization in traffic assignment with user constraints	2	0.46	2019
Timing portfolio strategies with exponential Lévy processes	0	0.34	2019
Congestion avoiding heuristic path generation for the proactive route guidance.	1	0.43	2018
The Traveling Purchaser Problem with time-dependent quantities.	3	0.38	2017
The probabilistic orienteering problem.	3	0.41	2017
A reclaimer scheduling problem arising in coal stockyard management	1	0.39	2016
The Stochastic and Dynamic Traveling Purchaser Problem	4	0.39	2016
Complexity and approximation for Traveling Salesman Problems with profits.	2	0.36	2014
Reclaimer Scheduling: Complexity and Algorithms.	0	0.34	2014
The Clustered Orienteering Problem.	6	0.56	2014
Optimal interval scheduling with a resource constraint	3	0.42	2014
Kernel Search: a new heuristic framework for portfolio selection	12	0.65	2012
On the complexity of interval scheduling with a resource constraint	13	0.61	2011
Look-ahead heuristics for the dynamic traveling purchaser problem	11	0.56	2011
Kernel search: A general heuristic for the multi-dimensional knapsack problem	35	1.10	2010
Geometric representation for semi on-line scheduling on uniform processors	3	0.39	2010
Comparison of policies in dynamic routing problems	4	0.42	2010
Exploring greedy criteria for the dynamic traveling purchaser problem	10	0.55	2009
Maximum Expected Utility of Markovian Predicted Wealth	0	0.34	2009
Semi-online scheduling on two uniform processors	16	1.01	2008
Competitive analysis of a dispatch policy for a dynamic multi-period routing problem	11	0.61	2007
Competitive analysis for dynamic multiperiod uncapacitated routing problems	20	0.98	2007
New Bounds And Algorithms For On-Line Scheduling: Two Identical Processors, Known Sum And Upper Bound On The Tasks	10	0.64	2006
The On-Line Multiprocessor Scheduling Problem with Known Sum of the Tasks	16	0.90	2004
Semi-On-line Scheduling on Two Parallel Processors with an Upper Bound on the Items.	14	0.92	2003
The application of a vehicle routing model to a waste-collection problem: two case studies	24	1.53	2002
The periodic vehicle routing problem with intermediate facilities	66	3.92	2002