Polyhedral Results and Branch-and-Cut for the Resource Loading Problem | Zendy

Guopeng Song | Zendy; Tamás Kis | Zendy; Roel Leus | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

Polyhedral Results and Branch-and-Cut for the Resource Loading Problem

Author(s) -

Guopeng Song,

Tamás Kis,

Roel Leus

Publication year - 2020

Publication title -

informs journal on computing

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 1.403

H-Index - 80

eISSN - 1526-5528

pISSN - 1091-9856

DOI - 10.1287/ijoc.2020.0957

Subject(s) - integer programming , polyhedron , branch and cut , mathematical optimization , linear programming , mathematical proof , set (abstract data type) , mathematics , function (biology) , computer science , branch and price , resource (disambiguation) , algorithm , combinatorics , programming language , computer network , geometry , evolutionary biology , biology

We study the resource loading problem, which arises in tactical capacity planning. In this problem, one has to plan the intensity of execution of a set of orders to minimize a cost function that pe...

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