description
- On identifying facets of the knapsack polytope by using strong minimal covers and maximal cliques, Integer Programming conference in honor of Egon.
On identifying facets of the knapsack polytope by using strong minimal covers and maximal cliques, Integer Programming conference in honor of Egon.
Invited Talk
2002
Invited conference
- Overview
Overview
located in
participant
- ESCUDERO BUENO, LAUREANO FERNANDO Conferencia