Global optimization of 0-1 hyperbolic programs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2190133
- On complexity of unconstrained hyperbolic 0--1 programming problems
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- A global approach for general 0-1 fractional programming
- Fractional 0-1 programming: applications and algorithms
Cited in
(27)- Special issue: Global solution of integer, stochastic and nonconvex optimization problems
- Submodularity in Conic Quadratic Mixed 0–1 Optimization
- Feature selection for consistent biclustering via fractional 0-1 programming
- Alternate solution approaches for competitive hub location problems
- On coalition formation in a non-convex multi-agent inventory problem
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- On a new class of nonlinear set covering problems arising in wireless network design
- Fractional 0-1 programming: applications and algorithms
- A review of recent advances in global optimization
- scientific article; zbMATH DE number 2190133 (Why is no real title available?)
- Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
- Finding checkerboard patterns via fractional 0-1 programming
- Fractional 0-1 programming and submodularity
- A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming
- The equitable dispersion problem
- On maximum ratio clique relaxations
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- The maximum ratio clique problem
- A fractional programming approach for retail category price optimization
- A review of deterministic optimization methods in engineering and management
- On complexity of unconstrained hyperbolic 0--1 programming problems
- A sixth bibliography of fractional programming
- A Branch-and-Cut Algorithm for Submodular Interdiction Games
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Hyperbolic set covering problems with competing ground-set elements
- Convex underestimation for posynomial functions of positive variables
- The packing while traveling problem
This page was built for publication: Global optimization of 0-1 hyperbolic programs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1810871)
