The following pages link to Pierre Hosteins (Q271992):
Displaying 18 items.
- Hybrid constructive heuristics for the critical node problem (Q271993) (← links)
- A genetic algorithm for a class of critical node problems (Q325485) (← links)
- A preliminary analysis of the distance based critical node problem (Q510911) (← links)
- The prize-collecting scheduling problem with deadlines (Q510929) (← links)
- A new, direct link between the baryon asymmetry and neutrino masses (Q985748) (← links)
- Successful leptogenesis in \(SO(10)\) unification with a left-right symmetric seesaw mechanism (Q985848) (← links)
- A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization (Q1628126) (← links)
- Polynomial and pseudo-polynomial time algorithms for different classes of the distance critical node problem (Q1634769) (← links)
- Complexity of the multilevel critical node problem (Q2121476) (← links)
- A compact mixed integer linear formulation for safe set problems (Q2228393) (← links)
- Optimal selection of contracts and work shifts in multi-skill call centers (Q2513755) (← links)
- VNS solutions for the critical node problem (Q2631225) (← links)
- The connected critical node problem (Q2672625) (← links)
- A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization (Q5131718) (← links)
- Constructive-destructive heuristics for the safe set problem (Q6047845) (← links)
- The stochastic critical node problem over trees (Q6092626) (← links)
- A combinatorial branch and bound for the safe set problem (Q6179692) (← links)
- The Team Orienteering Problem with Service Times and Mandatory & Incompatible Nodes (Q6749065) (← links)
