The following pages link to Massimiliano Caramia (Q190512):
Displaying 16 items.
- (Q4427860) (← links)
- Iterative coloring extension of a maximum clique (Q4544221) (← links)
- The Resource Constrained Project Scheduling Problem: A theoretical comparison between a recent formulation and the main time indexed linear programming based approaches (Q4603920) (← links)
- New lower bounds on the weighted chromatic number of a graph (Q4669427) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- A Fast Automatic Algorithm for Image Denoising by a Regularization Method (Q5317513) (← links)
- A manufacturing cell formation problem with a maximum cell workload constraint (Q5382721) (← links)
- Mining relevant information on the Web: a clique-based approach (Q5444416) (← links)
- (Q5708530) (← links)
- Graph-Theoretic Concepts in Computer Science (Q5710801) (← links)
- A lower bound on the chromatic number of Mycielski graphs (Q5937920) (← links)
- Constraint propagation in graph coloring (Q5960033) (← links)
- Sustainable two stage supply chain management: a quadratic optimization approach with a quadratic constraint (Q6170034) (← links)
- Novel bilevel formulations for waste management (Q6558683) (← links)
- Scheduling activities in project network with feeding precedence relations: an earliest start forward recursion algorithm (Q6588475) (← links)
- An algorithm to find stable solutions in linear-linear bilevel problems (Q6613944) (← links)
