Pages that link to "Item:Q1810871"

The following pages link to Global optimization of 0-1 hyperbolic programs (Q1810871):

Displaying 26 items.

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