On complexity of unconstrained hyperbolic 0--1 programming problems
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 2190133
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Unconstrained 0-1 nonlinear programming: A nondifferentiable approach
- Complexity results for some global optimization problems
Cites work
- A global approach for general 0-1 fractional programming
- A note on a global approach for general 0-1 fractional programming
- Approximation algorithms for NP-hard problems.
- Boolean query optimization and the 0-1 hyperbolic sum problem
- Complexity of uniqueness and local search in quadratic 0-1 programming
- Global optimization of 0-1 hyperbolic programs
- How easy is local search?
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 3249560 (Why is no real title available?)
- Hyperbolic 0-1 programming and query optimization in information retrieval
- NP is as easy as detecting unique solutions
- Programming with linear fractional functionals
- Pseudo-Boolean optimization
- Simple Local Search Problems that are Hard to Solve
- Solving a (0, 1) hyperbolic program by branch and bound
- The complexity of approximating a nonlinear program
- The set covering problem with linear fractional functional
Cited in
(30)- Hyperbolic 0-1 programming and query optimization in information retrieval
- Convergent outer approximation algorithms for solving unary programs
- On the complexity of postoptimality analysis of 0/1 programs
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management
- Fractional 0-1 programming: applications and algorithms
- A simple technique to improve linearized reformulations of fractional (hyperbolic) 0-1 programming problems
- Capacitated assortment and price optimization for customers with disjoint consideration sets
- Global optimization of 0-1 hyperbolic programs
- Alternate solution approaches for competitive hub location problems
- Fractional 0-1 programming and submodularity
- Fractional 0-1 programs: links between mixed-integer linear and conic quadratic formulations
- Probability of unique integer solution to a system of linear equations
- The maximum ratio clique problem
- A global optimization algorithm for solving the minimum multiple ratio spanning tree problem
- Uniqueness in quadratic and hyperbolic \(0-1\) programming problems
- Feature selection for consistent biclustering via fractional 0-1 programming
- On equivalent reformulations for absolute value equations
- Geometric inference for general high-dimensional linear inverse problems
- A sixth bibliography of fractional programming
- scientific article; zbMATH DE number 4033523 (Why is no real title available?)
- The maximum ratio clique problem: A continuous optimization approach and some new results
- scientific article; zbMATH DE number 2190133 (Why is no real title available?)
- Uniqueness of integer solution of linear equations
- Finding checkerboard patterns via fractional 0-1 programming
- On maximum ratio clique relaxations
- 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
- A review of recent advances in global optimization
- Analyzing the complexity of finding good neighborhood functions for local search algorithms
This page was built for publication: On complexity of unconstrained hyperbolic 0--1 programming problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1779713)
