T’kindt, Vincent; Della Croce, Federico; Liedloff, Mathieu Moderate exponential-time algorithms for scheduling problems. (English) Zbl 07618965 4OR 20, No. 4, 533-566 (2022). MSC: 68R05 68W01 68W40 90B35 PDFBibTeX XMLCite \textit{V. T'kindt} et al., 4OR 20, No. 4, 533--566 (2022; Zbl 07618965) Full Text: DOI
Shang, Lei; T’Kindt, Vincent; Della Croce, Federico Branch & memorize exact algorithms for sequencing problems: efficient embedding of memorization into search trees. (English) Zbl 1510.90121 Comput. Oper. Res. 128, Article ID 105171, 13 p. (2021). MSC: 90B35 PDFBibTeX XMLCite \textit{L. Shang} et al., Comput. Oper. Res. 128, Article ID 105171, 13 p. (2021; Zbl 1510.90121) Full Text: DOI
Della Croce, Federico; Scatamacchia, Rosario An exact approach for the bilevel knapsack problem with interdiction constraints and extensions. (English) Zbl 1450.90040 Math. Program. 183, No. 1-2 (B), 249-281 (2020). MSC: 90C27 90-08 90C10 PDFBibTeX XMLCite \textit{F. Della Croce} and \textit{R. Scatamacchia}, Math. Program. 183, No. 1--2 (B), 249--281 (2020; Zbl 1450.90040) Full Text: DOI arXiv
Della Croce, Federico; Salassa, Fabio; Scatamacchia, Rosario A new exact approach for the 0-1 collapsing knapsack problem. (English) Zbl 1402.90143 Eur. J. Oper. Res. 260, No. 1, 56-69 (2017). MSC: 90C27 90C09 90C10 90C57 PDFBibTeX XMLCite \textit{F. Della Croce} et al., Eur. J. Oper. Res. 260, No. 1, 56--69 (2017; Zbl 1402.90143) Full Text: DOI
Della Croce, Federico; Koulamas, Christos; T’kindt, Vincent A constraint generation approach for two-machine shop problems with jobs selection. (English) Zbl 1402.90050 Eur. J. Oper. Res. 259, No. 3, 898-905 (2017). MSC: 90B35 68W40 90C10 PDFBibTeX XMLCite \textit{F. Della Croce} et al., Eur. J. Oper. Res. 259, No. 3, 898--905 (2017; Zbl 1402.90050) Full Text: DOI
Billaut, Jean-Charles; Della Croce, Federico; Grosso, Andrea A single machine scheduling problem with two-dimensional vector packing constraints. (English) Zbl 1346.90327 Eur. J. Oper. Res. 243, No. 1, 75-81 (2015). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{J.-C. Billaut} et al., Eur. J. Oper. Res. 243, No. 1, 75--81 (2015; Zbl 1346.90327) Full Text: DOI HAL
T’kindt, V.; Della Croce, F. A note on “Two-machine flow-shop scheduling with rejection” and its link with flow-shop scheduling and common due date assignment. (English) Zbl 1349.90403 Comput. Oper. Res. 39, No. 12, 3244-3246 (2012). MSC: 90B35 PDFBibTeX XMLCite \textit{V. T'kindt} and \textit{F. Della Croce}, Comput. Oper. Res. 39, No. 12, 3244--3246 (2012; Zbl 1349.90403) Full Text: DOI
Della Croce, Federico; Garaix, Thierry; Grosso, Andrea Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem. (English) Zbl 1251.90130 Comput. Oper. Res. 39, No. 6, 1213-1217 (2012). MSC: 90B35 90C59 PDFBibTeX XMLCite \textit{F. Della Croce} et al., Comput. Oper. Res. 39, No. 6, 1213--1217 (2012; Zbl 1251.90130) Full Text: DOI arXiv
Della Croce, F.; Salassa, F. Improved LP-based algorithms for the closest string problem. (English) Zbl 1251.90278 Comput. Oper. Res. 39, No. 3, 746-749 (2012). MSC: 90C10 92C40 90C59 PDFBibTeX XMLCite \textit{F. Della Croce} and \textit{F. Salassa}, Comput. Oper. Res. 39, No. 3, 746--749 (2012; Zbl 1251.90278) Full Text: DOI
Della Croce, Federico; Grosso, Andrea Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem. (English) Zbl 1251.90279 Comput. Oper. Res. 39, No. 1, 27-31 (2012). MSC: 90C10 90C27 PDFBibTeX XMLCite \textit{F. Della Croce} and \textit{A. Grosso}, Comput. Oper. Res. 39, No. 1, 27--31 (2012; Zbl 1251.90279) Full Text: DOI
Della Croce, F.; Grosso, A. Computational experience with a core-based reduction procedure for the 2-knapsack problem. (English) Zbl 1231.90321 Comput. Oper. Res. 38, No. 2, 514-516 (2011). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{F. Della Croce} and \textit{A. Grosso}, Comput. Oper. Res. 38, No. 2, 514--516 (2011; Zbl 1231.90321) Full Text: DOI
Baptiste, P.; Della Croce, F.; Grosso, A.; T’kindt, V. Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances. (English) Zbl 1185.90065 J. Sched. 13, No. 1, 39-47 (2010). MSC: 90B35 PDFBibTeX XMLCite \textit{P. Baptiste} et al., J. Sched. 13, No. 1, 39--47 (2010; Zbl 1185.90065) Full Text: DOI
Grosso, A.; Della Croce, F.; Tadei, R. An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem. (English) Zbl 1056.90062 Oper. Res. Lett. 32, No. 1, 68-72 (2004). MSC: 90B35 PDFBibTeX XMLCite \textit{A. Grosso} et al., Oper. Res. Lett. 32, No. 1, 68--72 (2004; Zbl 1056.90062) Full Text: DOI
Bellanti, F.; Carello, G.; Della Croce, F.; Tadei, R. A greedy-based neighborhood search approach to a nurse rostering problem. (English) Zbl 1053.90090 Eur. J. Oper. Res. 153, No. 1, 28-40 (2004). MSC: 90B99 90C59 PDFBibTeX XMLCite \textit{F. Bellanti} et al., Eur. J. Oper. Res. 153, No. 1, 28--40 (2004; Zbl 1053.90090) Full Text: DOI
Bjorndal, M. H.; Caprara, A.; Cowling, P. I.; Della Croce, F.; Lourenço, H.; Malucelli, F.; Orman, A. J.; Pisinger, D.; Rego, C.; Salazar, J. J. Some thoughts on combinatorial optimisation. (English) Zbl 0904.90137 Eur. J. Oper. Res. 83, No. 2, 253-270 (1995). MSC: 90C27 PDFBibTeX XMLCite \textit{M. H. Bjorndal} et al., Eur. J. Oper. Res. 83, No. 2, 253--270 (1995; Zbl 0904.90137) Full Text: DOI