Global optimization of 0-1 hyperbolic programs

DOI10.1023/A:1021279918708zbMath1046.90054MaRDI QIDQ1810871

Shabbir Ahmed, Nikolaos V. Sahinidis, Mohit Tawarmalani

Publication date: 9 June 2003

Published in: Journal of Global Optimization (Search for Journal in Brave)

zbMATH Keywords

Facility locationFractional programmingConvex extensions

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Fractional programming (90C32)

Related Items (26)

A review of recent advances in global optimization ⋮ A Branch-and-Cut Algorithm for Submodular Interdiction Games ⋮ A global optimization algorithm for solving the minimum multiple ratio spanning tree problem ⋮ Fractional 0-1 programming and submodularity ⋮ Finding checkerboard patterns via fractional 0-1 programming ⋮ Fractional 0-1 programming: applications and algorithms ⋮ On maximum ratio clique relaxations ⋮ A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming ⋮ A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems ⋮ On coalition formation in a non-convex multi-agent inventory problem ⋮ A review of deterministic optimization methods in engineering and management ⋮ Submodularity in Conic Quadratic Mixed 0–1 Optimization ⋮ On a new class of nonlinear set covering problems arising in wireless network design ⋮ Convex underestimation for posynomial functions of positive variables ⋮ The packing while traveling problem ⋮ A fractional programming approach for retail category price optimization ⋮ Hyperbolic set covering problems with competing ground-set elements ⋮ On complexity of unconstrained hyperbolic 0--1 programming problems ⋮ Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations ⋮ Alternate solution approaches for competitive hub location problems ⋮ The equitable dispersion problem ⋮ Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm ⋮ A sixth bibliography of fractional programming ⋮ Feature selection for consistent biclustering via fractional 0-1 programming ⋮ Special issue: Global solution of integer, stochastic and nonconvex optimization problems ⋮ The maximum ratio clique problem

Uses Software

• MINOS
• Unnamed Item

This page was built for publication: Global optimization of 0-1 hyperbolic programs