The following pages link to Fabrizio Rossi (Q184628):
Displaying 32 items.
- Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
- Orbital branching (Q623461) (← links)
- (Q674440) (redirect page) (← links)
- Batch scheduling in a two-machine flow shop with limited buffer (Q674441) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- An optimization problem arising in the design of multiring systems (Q1576336) (← links)
- Models and algorithms for terrestrial digital broadcasting (Q1599350) (← links)
- Weak flow cover inequalities for the capacitated facility location problem (Q2029027) (← links)
- Codon optimization by 0-1 linear programming (Q2177826) (← 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)
- A note on the Cornaz-Jost transformation to solve the graph coloring problem (Q2444903) (← links)
- Time offset optimization in digital broadcasting (Q2473033) (← links)
- Annals of OR-special volume in memory of Mario Lucertini (Q2480196) (← links)
- LP-based dual bounds for the maximum quasi-clique problem (Q2664003) (← 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)
- 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)
- Cutting and Reuse: An Application from Automobile Component Manufacturing (Q3635152) (← links)
- An exact algorithm for the batch sequencing problem in a two-machine flow shop with limited buffer (Q4390594) (← links)
- (Q4495286) (← links)
- A discrete in continuous mathematical model of cardiac progenitor cells formation and growth as spheroid clusters (Cardiospheres) (Q4559629) (← links)
- (Q4836303) (← 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)
