Solving a (0, 1) hyperbolic program by branch and bound
From MaRDI portal
Publication:4102920
DOI10.1002/nav.3800220308zbMath0335.90042OpenAlexW2116612490MaRDI QIDQ4102920
Publication date: 1975
Published in: Naval Research Logistics Quarterly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.3800220308
Related Items (9)
Finding checkerboard patterns via fractional 0-1 programming ⋮ Fractional 0-1 programming: applications and algorithms ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ On complexity of unconstrained hyperbolic 0--1 programming problems ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations ⋮ Heuristic methods and applications: A categorized survey ⋮ Solution of a fractional combinatorial optimization problem by mixed integer programming ⋮ Feature selection for consistent biclustering via fractional 0-1 programming ⋮ Bibliography in fractional programming
Cites Work
This page was built for publication: Solving a (0, 1) hyperbolic program by branch and bound
