Výsledky vyhledávání - "cutting plane/branch and bound algorithm"

A cutting plane algorithm for a single machine scheduling problem

Autoři: Kristina Šorić Burkard, E. Rainer Leopold-Wildburger, Ulrike a další

Přispěvatelé: Kristina Šorić Burkard, E. Rainer Leopold-Wildburger, Ulrike a další

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

Témata: 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

Popis souboru: application/xml

Přístupová URL adresa: 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

A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing: A strong cutting plane/branch-and-bound algorithm for node packing

Autoři: George L. Nemhauser Gabriele Sigismondi

Zdroj: Journal of the Operational Research Society. 43:443-457

Témata: Computational methods for problems pertaining to operations research and mathematical programming, 0211 other engineering and technologies, node packing, Integer programming, cutting plane/branch-and-bound algorithm, heuristics, 0102 computer and information sciences, 02 engineering and technology, Programming involving graphs or networks, 01 natural sciences

Popis souboru: application/xml

Přístupová URL adresa: https://zbmath.org/90327
https://doi.org/10.1057/jors.1992.71
https://link.springer.com/content/pdf/10.1057%2Fjors.1992.71.pdf
https://rd.springer.com/content/pdf/10.1057%2Fjors.1992.71.pdf
https://link.springer.com/article/10.1057/jors.1992.71
https://www.tandfonline.com/doi/abs/10.1057/jors.1992.71

Some improvements in a cutting plane/branch and bound algorithm

Autoři: Šorić, Kristina Scitovski, Rudolf Hunjak, Tihomir

Přispěvatelé: Šorić, Kristina Scitovski, Rudolf Hunjak, Tihomir

Témata: mixed 0-1 programming problem, single machine scheduling, valid inequalities, cutting plane/branch and bound algorithm

Přístupová URL adresa: https://www.bib.irb.hr/34794