Projection and Lifting in Combinatorial Optimization
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
A polyhedral approach for a constrained quadratic 0-1 problem
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
A polyhedral approach for a constrained quadratic 0-1 problem
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Description of 2-integer continuous knapsack polyhedra
Discrete Optimization
| Hi-index | 0.04 |