Branch-and-refine for solving time-expanded MILP formulations.
Fabian GnegelArmin FügenschuhPublished in: Comput. Oper. Res. (2023)
Keyphrases
- mixed integer linear programming
- resource constrained project scheduling problem
- mixed integer linear
- linear program
- branch and bound algorithm
- mathematical programming
- nonlinear equations
- data sets
- information systems
- optimal solution
- artificial neural networks
- branch and bound
- optimization methods
- mixed integer
- quadratic programming