| Publication | Date of Publication | Type |
|---|
| Power Reduction in FM Networks by Mixed-Integer Programming. A Case Study | 2023-10-30 | Paper |
\((0, \pm 1)\) ideal matrices
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
An \(\mathcal{O} (n^2 \log{n})\) algorithm for the weighted stable set problem in claw-free graphs
Mathematical Programming. Series A. Series B | 2021-02-15 | Paper |
An \(\mathcal O(n\sqrt m)\) algorithm for the weighted stable set problem in \{claw, net\}-free graphs with \(\alpha(G)\geq 4\)
Discrete Optimization | 2018-05-24 | Paper |
An \(\mathcal{O}(m\log n)\) algorithm for the weighted stable set problem in claw-free graphs with \(\alpha ({G}) \leq 3\)
Mathematical Programming. Series A. Series B | 2017-07-21 | Paper |
The Hirsch conjecture for the fractional stable set polytope
Mathematical Programming. Series A. Series B | 2014-10-17 | Paper |
A reduction algorithm for the weighted stable set problem in claw-free graphs
Discrete Applied Mathematics | 2014-05-05 | Paper |
Negative cycle separation in wireless network design
Lecture Notes in Computer Science | 2011-09-09 | Paper |
Planning wireless networks by shortest path
Computational Optimization and Applications | 2011-05-25 | Paper |
Models and solution techniques for frequency assignment problems
Annals of Operations Research | 2008-03-31 | Paper |
Time offset optimization in digital broadcasting
Discrete Applied Mathematics | 2008-02-26 | Paper |
Metric inequalities and the network loading problem
Discrete Optimization | 2008-02-22 | Paper |
Computational study of large-scale p-median problems
Mathematical Programming. Series A. Series B | 2007-03-05 | Paper |
Integer Programming and Combinatorial Optimization
Lecture Notes in Computer Science | 2005-12-23 | Paper |
| scientific article; zbMATH DE number 2230234 (Why is no real title available?) | 2005-11-18 | Paper |
| scientific article; zbMATH DE number 2080329 (Why is no real title available?) | 2004-08-04 | Paper |
Models and solution techniques for frequency assignment problems
4OR | 2004-02-19 | Paper |
| scientific article; zbMATH DE number 2033323 (Why is no real title available?) | 2004-01-27 | Paper |
An enumerative algorithm for the frequency assignment problem
Discrete Applied Mathematics | 2003-07-30 | Paper |
A complete adaptive algorithm for propositional satisfiability
Discrete Applied Mathematics | 2003-06-10 | Paper |
Models and algorithms for terrestrial digital broadcasting
Annals of Operations Research | 2002-06-09 | Paper |
Minimizing the span \(d\)-walks to compute optimum frequency assignments.
Mathematical Programming. Series A. Series B | 2002-01-01 | Paper |
On the \(p\)-median polytope
Mathematical Programming. Series A. Series B | 2001-10-03 | Paper |
| Restoring satisfiability or maintaining unsatisfiability by finding small unsatisfiable subformulae | 2001-09-24 | Paper |
A Lagrangian-based heuristic for large-scale set covering problems
Mathematical Programming. Series A. Series B | 1999-09-05 | Paper |
| scientific article; zbMATH DE number 1175963 (Why is no real title available?) | 1998-07-19 | Paper |
Chair-free Berge graphs are perfect
Graphs and Combinatorics | 1998-07-08 | Paper |
(0, 1) ideal matrices
Mathematical Programming. Series A. Series B | 1998-03-11 | Paper |
| scientific article; zbMATH DE number 956849 (Why is no real title available?) | 1997-06-09 | Paper |
The rank facets of the stable set polytope for claw-free graphs
Journal of Combinatorial Theory. Series B | 1997-05-05 | Paper |
Solving hard set covering problems
Operations Research Letters | 1996-10-20 | Paper |
The anti-join composition and polyhedra
Discrete Mathematics | 1994-12-01 | Paper |
An exact algorithm for the maximum stable set problem
Computational Optimization and Applications | 1994-07-26 | Paper |
Polyhedral Properties of Clutter Amalgam
SIAM Journal on Discrete Mathematics | 1993-06-29 | Paper |
Stability number of bull- and chair-free graphs
Discrete Applied Mathematics | 1993-05-16 | Paper |
A characterization of knapsacks with the max-flow--min-cut property
Operations Research Letters | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 4172751 (Why is no real title available?) | 1990-01-01 | Paper |
On the 0,1 facets of the set covering polytope
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
On the facial structure of the set covering polytope
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
The complexity of matching with bonds
Information Processing Letters | 1989-01-01 | Paper |
Facets and lifting procedures for the set covering polytope
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
A decomposition strategy for the vertex cover problem
Information Processing Letters | 1989-01-01 | Paper |
| Scheduling tasks with sequence-dependent processing times | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4060740 (Why is no real title available?) | 1988-01-01 | Paper |
A Class of Polynomially Solvable Set-Covering Problems
SIAM Journal on Discrete Mathematics | 1988-01-01 | Paper |
An O(m n) algorithm for regular set-covering problems
Theoretical Computer Science | 1987-01-01 | Paper |
A function space approach to the foundations of system theory
International Journal of Systems Science. Principles and Applications of Systems and Integration | 1983-01-01 | Paper |
