On complexity of unconstrained hyperbolic 0--1 programming problems
From MaRDI portal
Publication:1779713
DOI10.1016/j.orl.2004.05.011zbMath1140.90469OpenAlexW2088033563MaRDI QIDQ1779713
Hong-Xuan Huang, Oleg A. Prokopyev, Panos M. Pardalos
Publication date: 1 June 2005
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.orl.2004.05.011
Related Items
A review of recent advances in global optimization, Geometric inference for general high-dimensional linear inverse problems, Analyzing the complexity of finding good neighborhood functions for local search algorithms, Least squares approximate policy iteration for learning bid prices in choice-based revenue management, A global optimization algorithm for solving the minimum multiple ratio spanning tree problem, Fractional 0-1 programming and submodularity, On equivalent reformulations for absolute value equations, Uniqueness of integer solution of linear equations, Finding checkerboard patterns via fractional 0-1 programming, Fractional 0-1 programming: applications and algorithms, On maximum ratio clique relaxations, The Maximum Ratio Clique Problem: A Continuous Optimization Approach and Some New Results, A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems, Uniqueness in quadratic and hyperbolic \(0-1\) programming problems, Capacitated assortment and price optimization for customers with disjoint consideration sets, An extension of branch-and-bound algorithm for solving sum-of-nonlinear-ratios problem, Scheduling tasks with exponential duration on unrelated parallel machines, Hyperbolic set covering problems with competing ground-set elements, Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations, Probability of unique integer solution to a system of linear equations, Alternate solution approaches for competitive hub location problems, A sixth bibliography of fractional programming, Feature selection for consistent biclustering via fractional 0-1 programming, The maximum ratio clique problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pseudo-Boolean optimization
- NP is as easy as detecting unique solutions
- How easy is local search?
- The set covering problem with linear fractional functional
- Hyperbolic 0-1 programming and query optimization in information retrieval
- Complexity of uniqueness and local search in quadratic 0-1 programming
- A note on a global approach for general 0-1 fractional programming
- A global approach for general \(0-1\) fractional programming
- Boolean query optimization and the 0-1 hyperbolic sum problem
- Global optimization of 0-1 hyperbolic programs
- Simple Local Search Problems that are Hard to Solve
- Solving a (0, 1) hyperbolic program by branch and bound
- Programming with linear fractional functionals
