A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem
From MaRDI portal
Publication:3133219
DOI10.1007/978-3-319-44914-2_20zbMath1391.90417arXiv1603.04597OpenAlexW2299898751MaRDI QIDQ3133219
Irina Utkina, Mikhail Batsyn, Ekaterina Batsyna
Publication date: 13 February 2018
Published in: Discrete Optimization and Operations Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.04597
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32) Boolean programming (90C09)
This page was built for publication: A Branch and Bound Algorithm for a Fractional 0-1 Programming Problem