| Publication | Date of Publication | Type |
|---|
The stable set problem: clique and nodal inequalities revisited Computers & Operations Research | 2021-04-20 | Paper |
Strengthening Chvátal-Gomory cuts for the stable set problem Lecture Notes in Computer Science | 2016-11-30 | Paper |
Robust Shift Scheduling in Call Centers Lecture Notes in Computer Science | 2015-10-16 | Paper |
Ellipsoidal relaxations of the stable set problem: theory and algorithms SIAM Journal on Optimization | 2015-10-01 | Paper |
Strong lift-and-project cutting planes for the stable set problem Mathematical Programming. Series A. Series B | 2013-11-11 | Paper |
Routing concurrent video signals over SDH networks Electronic Notes in Discrete Mathematics | 2012-05-13 | Paper |
Solving large Steiner Triple Covering Problems Operations Research Letters | 2011-08-09 | Paper |
A new approach to the stable set problem based on ellipsoids Integer Programming and Combinatoral Optimization | 2011-06-24 | Paper |
A Lagrangian heuristic for satellite range scheduling with resource constraints Computers & Operations Research | 2011-04-28 | Paper |
Orbital branching Mathematical Programming. Series A. Series B | 2011-02-14 | Paper |
The Network Packing Problem in Terrestrial Broadcasting Operations Research | 2009-08-13 | Paper |
An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem Mathematical Programming. Series A. Series B | 2009-07-24 | Paper |
Constraint Orbital Branching Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Annals of OR-special volume in memory of Mario Lucertini Annals of Operations Research | 2008-03-31 | Paper |
Time offset optimization in digital broadcasting Discrete Applied Mathematics | 2008-02-26 | Paper |
Orbital Branching Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
A competitive scheduling problem and its relevance to UMTS channel assignment Networks | 2005-01-12 | Paper |
An implicit enumeration scheme for the batch selection problem Networks | 2005-01-12 | Paper |
| scientific article; zbMATH DE number 1523212 (Why is no real title available?) | 2003-06-19 | Paper |
| scientific article; zbMATH DE number 1852950 (Why is no real title available?) | 2003-01-13 | Paper |
A branch-and-cut algorithm for the maximum cardinality stable set problem Operations Research Letters | 2002-07-30 | Paper |
Models and algorithms for terrestrial digital broadcasting Annals of Operations Research | 2002-06-09 | Paper |
A set packing model for the ground holding problem in congested networks European Journal of Operational Research | 2001-06-26 | Paper |
A three-dimensional matching model for perishable production scheduling Discrete Applied Mathematics | 1999-04-13 | Paper |
| scientific article; zbMATH DE number 1149868 (Why is no real title available?) | 1998-07-08 | Paper |