A Polyhedral Approach for Nonconvex Quadratic Programming Problemswith Box Constraints
Journal of Global Optimization
Branch-and-Cut Algorithms for Combinatorial Optimization and Their Implementation in ABACUS
Computational Combinatorial Optimization, Optimal or Provably Near-Optimal Solutions [based on a Spring School]
Discrete Applied Mathematics
Block linear majorants in quadratic 0-1 optimization
Discrete Applied Mathematics - The fourth international colloquium on graphs and optimisation (GO-IV)
A polyhedral approach for a constrained quadratic 0-1 problem
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
A linearization framework for unconstrained quadratic (0-1) problems
Discrete Applied Mathematics
A polyhedral approach for a constrained quadratic 0-1 problem
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Integer quadratic quasi-polyhedra
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.00 |