The following pages link to Stefano Smriglio (Q184629):
Displaying 26 items.
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Orbital branching (Q623461) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- A three-dimensional matching model for perishable production scheduling (Q1283066) (← links)
- (Q1599349) (redirect page) (← links)
- Models and algorithms for terrestrial digital broadcasting (Q1599350) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- Time offset optimization in digital broadcasting (Q2473033) (← links)
- Annals of OR-special volume in memory of Mario Lucertini (Q2480196) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
- Routing Concurrent Video Signals over SDH Networks (Q2883647) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- A competitive scheduling problem and its relevance to UMTS channel assignment (Q3156827) (← links)
- An implicit enumeration scheme for the batch selection problem (Q3156829) (← links)
- Robust Shift Scheduling in Call Centers (Q3195343) (← links)
- The Network Packing Problem in Terrestrial Broadcasting (Q3392007) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
- (Q4387263) (← links)
- (Q4511443) (← links)
- (Q4789480) (← links)
- Orbital Branching (Q5429261) (← links)
- A set packing model for the ground holding problem in congested networks (Q5935422) (← links)
- A branch-and-cut algorithm for the maximum cardinality stable set problem (Q5940036) (← links)
