Pages that link to "Item:Q1779713"
From MaRDI portal
The following pages link to On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713):
Displaying 24 items.
- Geometric inference for general high-dimensional linear inverse problems (Q309721) (← links)
- Uniqueness of integer solution of linear equations (Q601980) (← links)
- Finding checkerboard patterns via fractional 0-1 programming (Q604870) (← links)
- An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem (Q691453) (← links)
- Scheduling tasks with exponential duration on unrelated parallel machines (Q714038) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- A review of recent advances in global optimization (Q842710) (← links)
- Analyzing the complexity of finding good neighborhood functions for local search algorithms (Q857808) (← links)
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management (Q1652041) (← 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)
- Capacitated assortment and price optimization for customers with disjoint consideration sets (Q1728178) (← links)
- Alternate solution approaches for competitive hub location problems (Q2029306) (← links)
- Fractional 0-1 programming and submodularity (Q2162513) (← links)
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations (Q2274883) (← links)
- Probability of unique integer solution to a system of linear equations (Q2275621) (← links)
- The maximum ratio clique problem (Q2356159) (← links)
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem (Q2392120) (← links)
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems (Q2450746) (← links)
- Feature selection for consistent biclustering via fractional 0-1 programming (Q2576438) (← links)
- On equivalent reformulations for absolute value equations (Q2655401) (← links)
- A sixth bibliography of fractional programming (Q3426331) (← links)
- The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results (Q5356986) (← links)
- On maximum ratio clique relaxations (Q6085884) (← links)