Search    Browse

The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Federico Della Croce" ( http://dblp.L3S.de/Authors/Federico_Della_Croce )

  Author page on DBLP  Author page in RDF  Community of Federico Della Croce in ASPL-2

Publication years (Num. hits)
1993-2004 (17) 2005-2010 (17) 2011-2012 (8)
Publication types (Num. hits)
article(36) inproceedings(6)
Venues (Conferences, Journals, ...)
Computers & OR(7) Oper. Res. Lett.(7) European Journal of Operationa...(4) J. Comb. Optim.(3) J. Scheduling(3) Discrete Applied Mathematics(2) ICRA(2) ISAAC(2) J. Heuristics(2) Networks(2) Algorithmic Operations Researc...(1) Computers & Industrial Enginee...(1) Electronic Notes in Discrete M...(1) EvoCOP(1) ICCSA(1) INFORMS Journal on Computing(1) More (+10 of total 18)
Authors
Federico Della Croce(42) Roberto Tadei(12) Vangelis Th. Paschos(12) Andrea Grosso(11) Vincent T'Kindt(5) Bruno Escoffier(4) Marco Ghirardi(4) Giuliana Carello(3) Marco Locatelli(3) Alexey Baburin(2) Cécile Murat(2) Edward Gimadi(2) Fabio Salassa(2) Giuseppe Volta(2) Nicolas Bourgeois(2) Thierry Garaix(2) More (+10 of total 37)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 17 occurrences of 15 keywords
Results
Found 42 publication records. Showing 42 according to the selection in the facets
Hits ?▲ Authors Title Venue Year Link Author keywords
1Federico Della Croce, Dominique Quadri Improving an exact approach for solving separable integer quadratic knapsack problems. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Andrea Grosso Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. Search on Bibsonomy Computers & OR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Thierry Garaix, Andrea Grosso Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. Search on Bibsonomy Computers & OR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Fabio Salassa Improved LP-based algorithms for the closest string problem. Search on Bibsonomy Computers & OR The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
1Ramesh Bollapragada, Federico Della Croce, Marco Ghirardi Discrete-time, economic lot scheduling problem on multiple, non-identical production lines. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, E. Desmier, Thierry Garaix A note on "Beam search heuristics for the single machine early/tardy scheduling problem with no machine idle time". Search on Bibsonomy Computers & Industrial Engineering The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Andrea Grosso Computational experience with a core-based reduction procedure for the 2-knapsack problem. Search on Bibsonomy Computers & OR The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Andrea Grosso, Fabio Salassa A Matheuristic Approach for the Total Completion Time Two-Machines Permutation Flow Shop Problem. Search on Bibsonomy EvoCOP The full citation details ... 2011 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Vincent T'Kindt Improving the preemptive bound for the single machine dynamic maximum lateness problem. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1P. Baptiste, Federico Della Croce, Andrea Grosso, Vincent T'Kindt Sequencing a single machine with due dates and deadlines: an ILP-based approach to solve very large instances. Search on Bibsonomy J. Scheduling The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Vangelis Th. Paschos, Roberto Wolfler Calvo Approximating the metric 2-Peripatetic Salesman Problem. Search on Bibsonomy Algorithmic Operations Research The full citation details ... 2010 DBLP  BibTeX  RDF
1Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos Probabilistic graph-coloring in bipartite and split graphs. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2009 DBLP  DOI  BibTeX  RDF Probabilistic optimization, Approximation algorithms, Graph coloring
1Federico Della Croce, Andrea Grosso, Marco Locatelli A heuristic approach for the max-min diversity problem based on max-clique. Search on Bibsonomy Computers & OR The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Alexey Baburin, Federico Della Croce, Edward Gimadi, Y. V. Glazkov, Vangelis Th. Paschos Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Nicolas Bourgeois, Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos Exact Algorithms for Dominating Clique Problems. Search on Bibsonomy ISAAC The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mohamed Ali Aloulou, Federico Della Croce Complexity of single machine scheduling problems under scenario-based uncertainty. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Vangelis Th. Paschos Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems. Search on Bibsonomy Operational Research The full citation details ... 2008 DBLP  DOI  BibTeX  RDF Dominance conditions, Set covering, Max cut, Worst-case complexity
1Federico Della Croce, Bruno Escoffier, Vangelis Th. Paschos Improved worst-case complexity for the MIN 3-SET COVERING problem. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Marcin Jakub Kaminski, Vangelis Th. Paschos An exact algorithm for MAX-CUT in sparse graphs. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Vincent T'Kindt, Federico Della Croce, Jean-Louis Bouquard Enumeration of Pareto Optima for a Flowshop Scheduling Problem with Two Criteria. Search on Bibsonomy INFORMS Journal on Computing The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Yury Glazkov, Alexey Baburin, Edward Gimadi, Federico Della Croce, Vangelis Th. Paschos Approximation algorithms for 2-Peripathetic Salesman Problem with edge weights 1 and 2. Search on Bibsonomy Electronic Notes in Discrete Mathematics The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Giuliana Carello, Federico Della Croce, Andrea Grosso, Marco Locatelli A "maximum node clustering" problem. Search on Bibsonomy J. Comb. Optim. The full citation details ... 2006 DBLP  DOI  BibTeX  RDF Maximum Node Clustering, Complexity, Approximation, Knapsack
1Federico Della Croce, Dario Oliveri Scheduling the Italian Football League: an ILP-based approach. Search on Bibsonomy Computers & OR The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Bruno Escoffier, Cécile Murat, Vangelis Th. Paschos Probabilistic Coloring of Bipartite and Split Graphs. Search on Bibsonomy ICCSA The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Vangelis Th. Paschos Computing Optimal Solutions for the min 3-set covering Problem. Search on Bibsonomy ISAAC The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Andrea Grosso, Federico Della Croce, Roberto Tadei An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Giuliana Carello, Federico Della Croce, Marco Ghirardi, Roberto Tadei Solving the Hub location problem in telecommunication network design: A local search approach. Search on Bibsonomy Networks The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Luigi De Giovanni, Federico Della Croce, Roberto Tadei On the impact of the solution representation for the Internet Protocol Network Design Problem with max-hop constraints. Search on Bibsonomy Networks The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1F. Bellanti, Giuliana Carello, Federico Della Croce, Roberto Tadei A greedy-based neighborhood search approach to a nurse rostering problem. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2004 DBLP  DOI  BibTeX  RDF
1Vincent T'Kindt, Federico Della Croce, Carl Esswein Revisiting Branch and Bound Search Strategies for Machine Scheduling Problems. Search on Bibsonomy J. Scheduling The full citation details ... 2004 DBLP  DOI  BibTeX  RDF search tree strategies, dominance properties, branch and bound
1Federico Della Croce, Andrea Grosso, Vangelis Th. Paschos Lower Bounds on the Approximation Ratios of Leading Heuristics for the Single-Machine Total Tardiness Problem. Search on Bibsonomy J. Scheduling The full citation details ... 2004 DBLP  DOI  BibTeX  RDF total tardiness, scheduling, approximation
1Federico Della Croce, Marco Ghirardi, Roberto Tadei Recovering Beam Search: Enhancing the Beam Search Approach for Combinatorial Optimization Problems. Search on Bibsonomy J. Heuristics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF recovering beam search, scheduling, heuristics, location
1Andrea Grosso, Marco Locatelli, Federico Della Croce Combining Swaps and Node Weights in an Adaptive Greedy Approach for the Maximum Clique Problem. Search on Bibsonomy J. Heuristics The full citation details ... 2004 DBLP  DOI  BibTeX  RDF greedy algorithm, adaptive search, maximum clique problem
1Federico Della Croce, Vincent T'Kindt Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Marco Ghirardi, Roberto Tadei An improved branch-and-bound algorithm for the two machine total completion time flow shop problem. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Roberto Tadei, Guido Perboli, Federico Della Croce A Heuristic Algorithm for the Auto-Carrier Transportation Problem. Search on Bibsonomy Transportation Science The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Roberto Tadei, Andrea Grosso, Federico Della Croce Finding the Pareto-optima for the total and maximum tardiness single machine problem. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2002 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Jatinder N. D. Gupta, Roberto Tadei Minimizing tardy jobs in a flowshop with common due date. Search on Bibsonomy European Journal of Operational Research The full citation details ... 2000 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Vangelis Th. Paschos, Alexis Tsoukiàs An improved general procedure for lexicographic bottleneck problems. Search on Bibsonomy Oper. Res. Lett. The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Federico Della Croce, Roberto Tadei, Giuseppe Volta A genetic algorithm for the job shop problem. Search on Bibsonomy Computers & OR The full citation details ... 1995 DBLP  DOI  BibTeX  RDF
1Giuseppe Menga, Roberto Tadei, M. Trubian, Giuseppe Volta, Federico Della Croce Production Scheduling for Perishable Goods: A Case Study. Search on Bibsonomy ICRA The full citation details ... 1994 DBLP  BibTeX  RDF
1Federico Della Croce, Roberto Tadei, Paolo Baracco, Raffaele Di Tullio On Minimizing the Weighted Sum Of Quadratic Completion Times on a Single Machine. Search on Bibsonomy ICRA The full citation details ... 1993 DBLP  BibTeX  RDF
Displaying result #1 - #42 of 42 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.