A Branch-and-Bound Algorithm for the Prize-Collecting...

INFORMS Journal on Computing 2018 / 01 Vol. 30; Iss. 1

A Branch-and-Bound Algorithm for the Prize-Collecting Single-Machine Scheduling Problem with Deadlines and Total Tardiness Minimization

Cordone, Roberto, Hosteins, Pierre, Righini, Giovanni
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
30
Language:
english
Journal:
INFORMS Journal on Computing
DOI:
10.1287/ijoc.2017.0772
Date:
January, 2018
File:
PDF, 523 KB
english, 2018
Conversion to is in progress
Conversion to is failed