Text

Decomposition Branching for Mixed Integer Programming

We introduce a novel and powerful approach for solving certain classes of mixed integer programs (MIPs): decomposition branching. Two seminal and widely used techniques for solving MIPs, branch-and-bound and decomposition, form its foundation. Computational experiments with instances of a weighted set covering problem and a regionalized p-median facility location problem with assignment range constraints demonstrate its efficacy: it explores far fewer nodes and can be orders of magnitude faster than a commercial solver and an automatic Dantzig-Wolfe approach.

Ketersediaan

Informasi Detail

Judul Seri

OPERATIONS RESEARCH; Vol.70 No.3 May-June 2022

No. Panggil

-

Penerbit

: .,

Deskripsi Fisik

p. 1854-1872

Bahasa

English

ISBN/ISSN

-

Klasifikasi

NONE

Tipe Isi

-

Tipe Media

-

Tipe Pembawa

-

Edisi

-

Subjek

SET COVERING
COMBINATORIAL OPTIMIZATION
BRANCH-AND-BOUND
MIXED INTEGER PROGRAMMING
FACILITY LOCATION
DECOMPOSITION ALGORITHMS

Info Detail Spesifik

https://doi.org/10.1287/opre.2021.2210

Pernyataan Tanggungjawab

Barıs Yıldız, Natashia Boland, Martin Savelsbergh

Versi lain/terkait

Lampiran Berkas

Komentar