# Search results for: F. Della Croce

Journal of Scheduling > 2019 > 22 > 1 > 59-68

Discrete Applied Mathematics > 2013 > 161 > 4-5 > 558-572

Computers and Operations Research > 2012 > 39 > 12 > 3244-3246

Theoretical Computer Science > 2012 > 459 > Complete > 77-88

Information Processing Letters > 2012 > 112 > 19 > 738-742

Computers and Operations Research > 2012 > 39 > 6 > 1213-1217

Computers and Operations Research > 2012 > 39 > 3 > 746-749

Computers and Operations Research > 2012 > 39 > 1 > 27-31

Computers and Operations Research > 2011 > 38 > 2 > 514-516

Computers & Industrial Engineering > 2011 > 60 > 1 > 183-186

Operations Research Letters > 2010 > 38 > 6 > 589-591

Journal of Scheduling > 2010 > 13 > 1 > 39-47

Discrete Applied Mathematics > 2009 > 157 > 9 > 1988-1992

_{min}) in a complete (undirected) graph with edge weights 1 and 2 is considered. Polynomial time approximation algorithms are proposed with performance ratios 5/4 (in the case of one weight function) and 11/7 (in the case of two weight functions), respectively.

Journal of Combinatorial Optimization > 2009 > 17 > 3 > 274-311

Operations Research Letters > 2007 > 35 > 3 > 403-408

Computers and Operations Research > 2006 > 33 > 7 > 1963-1974

European Journal of Operational Research > 2004 > 153 > 1 > 28-40

Operations Research Letters > 2004 > 32 > 1 > 68-72

Journal of Heuristics > 2004 > 10 > 2 > 135-152

Journal of Heuristics > 2004 > 10 > 1 > 89-104