Suchergebnisse - "branch and bound/cutting plane algorithm"

A cutting plane algorithm for a single machine scheduling problem

Autoren: Kristina Šorić Burkard, E. Rainer Leopold-Wildburger, Ulrike et al.

Weitere Verfasser: Kristina Šorić Burkard, E. Rainer Leopold-Wildburger, Ulrike et al.

Quelle: European Journal of Operational Research. 127:383-393

Schlagwörter: mixed 0-1 programming problem, single machine scheduling, valid inequalities, branch and bound/cutting plane algorithm, Combinatorial optimization, cutting plane/branch and bound algorithm, Deterministic scheduling theory in operations research, 0211 other engineering and technologies, 02 engineering and technology, cutting plane algorithm, mixed \(0-1\) programming problem, single machine scheduling problem, Mixed integer programming, Polyhedral combinatorics, branch-and-bound, branch-and-cut

Dateibeschreibung: application/xml

Zugangs-URL: https://www.bib.irb.hr/39061
https://www.bib.irb.hr/34889
https://www.bib.irb.hr/34890
https://zbmath.org/1545199
https://doi.org/10.1016/s0377-2217(99)00493-2
https://elibrary.ru/item.asp?id=413897
https://ideas.repec.org/a/eee/ejores/v127y2000i2p383-393.html
https://dblp.uni-trier.de/db/journals/eor/eor127.html#Soric00
http://www.sciencedirect.com/science/article/pii/S0377221799004932
https://www.sciencedirect.com/science/article/pii/S0377221799004932
https://EconPapers.repec.org/RePEc:eee:ejores:v:127:y:2000:i:2:p:383-393