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...

Full description

Saved in:
Bibliographic Details
Published in:2017 Constructive Nonsmooth Analysis and Related Topics (dedicated to the memory of V.F. Demyanov) (CNSA) pp. 1 - 3
Main Author: Mezentsev, Yurii
Format: Conference Proceeding
Language:English
Published: IEEE 01.05.2017
Subjects:
Delays
Hypercubes
Job shop scheduling
Linear programming
Mixed integer linear programming
Optimization
Parallel machines
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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