The following pages link to Andrea Grosso (Q189398):
Displaying 39 items.
- Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
- A single machine scheduling problem with two-dimensional vector packing constraints (Q319018) (← links)
- A genetic algorithm for a class of critical node problems (Q325485) (← links)
- Searching for a cycle with maximum coverage in undirected graphs (Q331987) (← links)
- A preliminary analysis of the distance based critical node problem (Q510911) (← links)
- Complexity of the critical node problem over trees (Q547128) (← links)
- (Q709197) (redirect page) (← links)
- Computational experience with a core-based reduction procedure for the 2-knapsack problem (Q709198) (← links)
- Construction and improvement algorithms for dispersion problems (Q726217) (← links)
- A matheuristic approach for the two-machine total completion time flow shop problem (Q744632) (← links)
- Solving molecular distance geometry problems by global optimization algorithms (Q842778) (← links)
- A population-based approach for hard global optimization problems based on dissimilarity measures (Q879969) (← links)
- Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
- Sequencing a single machine with due dates and deadlines: An ILP-based approach to solve very large instances (Q969755) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- A heuristic approach for the max-min diversity problem based on max-clique (Q1010298) (← links)
- Finding maximin Latin hypercube designs by iterated local search heuristics (Q1014951) (← 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)
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
- Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem (Q1761940) (← links)
- Iterated local search and very large neighborhoods for the parallel-machines total tardiness problem (Q1762096) (← links)
- Finding the Pareto-optima for the total and maximum tardiness single machine problem (Q1850123) (← links)
- Branch and cut algorithms for detecting critical nodes in undirected graphs (Q1935569) (← links)
- Identifying critical nodes in undirected graphs: complexity results and polynomial algorithms for the case of bounded treewidth (Q2444525) (← links)
- An experimental analysis of a population based approach for global optimization (Q2477011) (← links)
- A ``maximum node clustering'' problem (Q2479564) (← links)
- VNS solutions for the critical node problem (Q2631225) (← links)
- Column generation and rounding heuristics for minimizing the total weighted completion time on a single batching machine (Q2669805) (← links)
- The connected critical node problem (Q2672625) (← links)
- (Q3081837) (← links)
- A new decomposition approach for the single machine total tardiness scheduling problem (Q3157785) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5892099) (← links)
- Lower bounds on the approximation ratios of leading heuristics for the single-machine total tardiness problem (Q5920391) (← links)
- Algorithmic paradoxes of the single-machine total tardiness problem (Q5937433) (← links)
- Optimal facility location with random throughput costs (Q5959384) (← links)
- Job Shop Scheduling via Deep Reinforcement Learning: a Sequence to Sequence approach (Q6446170) (← links)
- Efficient arc-flow formulations for makespan minimisation on parallel machines with a common server (Q6521671) (← links)
- The daily swab test collection problem (Q6547116) (← links)
