Binary cut-and-branch method for solving mixed integer programming problems

The report is dedicated to the description of the algorithm for one of the methods for solving mixed-integer linear programming problems, which is based on binary cuttings. One of its algorithms, a hybrid algorithm based on binary cuts and branches, which combines the idea of the branch-and-bound me...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	2017 Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V.F. Demyanov) (CNSA) s. 1 - 3
Hlavní autor:	Mezentsev, Yurii
Médium:	Konferenční příspěvek
Jazyk:	angličtina
Vydáno:	IEEE 01.05.2017
Témata:	Delays Hypercubes Job shop scheduling Linear programming Mixed integer linear programming Optimization Parallel machines
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	The report is dedicated to the description of the algorithm for one of the methods for solving mixed-integer linear programming problems, which is based on binary cuttings. One of its algorithms, a hybrid algorithm based on binary cuts and branches, which combines the idea of the branch-and-bound method with the construction of cutting planes, is extended to milp problems.
DOI:	10.1109/CNSA.2017.7973989