The following pages link to Frederico Della Croce (Q1592282):
Displayed 50 items.
- (Q189399) (redirect page) (← links)
- MP or not MP: that is the question (Q283264) (← links)
- The Red-Blue transportation problem (Q296580) (← links)
- A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
- The selective fixing algorithm for the closest string problem (Q336747) (← links)
- A hybrid heuristic approach for single machine scheduling with release times (Q336949) (← links)
- A note on ``Two-machine flow-shop scheduling with rejection'' and its link with flow-shop scheduling and common due date assignment (Q339677) (← links)
- A hybrid three-phase approach for the Max-Mean dispersion problem (Q342328) (← links)
- Discrete-time, economic lot scheduling problem on multiple, non-identical production lines (Q421620) (← links)
- Improving an exact approach for solving separable integer quadratic knapsack problems (Q434199) (← links)
- A note on minimizing the sum of quadratic completion times on two identical parallel machines (Q456107) (← links)
- A variable neighborhood search based matheuristic for nurse rostering problems (Q475191) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- On the max min vertex cover problem (Q499339) (← links)
- Improving the preemptive bound for the single machine dynamic maximum lateness problem (Q614050) (← links)
- Computational experience with a core-based reduction procedure for the 2-knapsack problem (Q709198) (← links)
- Probabilistic graph-coloring in bipartite and split graphs (Q732320) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- Complexity of single machine scheduling problems under scenario-based uncertainty (Q943794) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- Exploiting dominance conditions for computing non trivial worst-case complexity for bounded combinatorial optimization problems (Q1001381) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- Approximation algorithms for the 2-peripatetic salesman problem with edge weights 1 and 2 (Q1026101) (← links)
- An improved general procedure for lexicographic bottleneck problems (Q1306359) (← links)
- Cellular control of manufacturing systems (Q1309976) (← links)
- A multi-KP modeling for the maximum-clique problem (Q1328650) (← links)
- A genetic algorithm for the job shop problem (Q1342314) (← links)
- Generalized pairwise interchanges and machine scheduling (Q1388824) (← links)
- Aggregate planning and scheduling in the food industry: A case study (Q1390328) (← links)
- Improving the preemptive bound for the one-machine dynamic total completion time scheduling problem. (Q1413906) (← links)
- A greedy-based neighborhood search approach to a nurse rostering problem. (Q1417481) (← links)
- An enhanced dynasearch neighborhood for the single-machine total weighted tardiness scheduling problem (Q1433664) (← links)
- Solution of the single machine total tardiness problem (Q1592283) (← links)
- An improved branch-and-bound algorithm for the two machine total completion time flow shop problem (Q1604072) (← links)
- New exact approaches and approximation results for the penalized knapsack problem (Q1634770) (← links)
- Approximation results for the incremental knapsack problem (Q1642685) (← links)
- An exact approach for the 0-1 knapsack problem with setups (Q1652189) (← links)
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- A constraint generation approach for two-machine shop problems with jobs selection (Q1751902) (← links)
- A new exact approach for the 0-1 collapsing knapsack problem (Q1753399) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- Improved LP-based algorithms for the closest string problem (Q1762033) (← links)
- Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096) (← links)
- An exact exponential branch-and-merge algorithm for the single machine total tardiness problem (Q1786599) (← links)
- Recovering beam search: Enhancing the beam search approach for combinatorial optimization problems (Q1826491) (← links)
- Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
- Fast algorithms for min independent dominating set (Q1941381) (← links)
- Scheduling a round robin tennis tournament under courts and players availability constraints (Q1960328) (← links)
- Minimizing tardy jobs in a flowshop with common due date (Q1969838) (← links)