On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint | Zendy

Laureano F. Escudero | Zendy; María Araceli Garín Martín | Zendy; Gloria Pérez Sainz de Rozas | Zendy

Open Access

On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0–1 knapsack constraint

Author(s) -

Laureano F. Escudero,

María Araceli Garín Martín,

Gloria Pérez Sainz de Rozas

Publication year - 1999

Publication title -

top

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.676

H-Index - 26

eISSN - 1863-8279

pISSN - 1134-5764

DOI - 10.1007/bf02564716

Subject(s) - knapsack problem , convex hull , hull , mathematics , constraint (computer aided design) , cover (algebra) , reduction (mathematics) , regular polygon , set (abstract data type) , continuous knapsack problem , mathematical optimization , scheme (mathematics) , combinatorics , computer science , geometry , mathematical analysis , engineering , mechanical engineering , marine engineering , programming language

0–1 program, cover, clique, knapsack constraint, coefficient increase, coefficient reduction, 90C09, 90C10,

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research