On complexity of unconstrained hyperbolic 0--1 programming problems (Q1779713): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2004.05.011 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088033563 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The set covering problem with linear fractional functional / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2743964 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-Boolean optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Programming with linear fractional functionals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boolean query optimization and the 0-1 hyperbolic sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hyperbolic 0-1 programming and query optimization in information retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: How easy is local search? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A global approach for general \(0-1\) fractional programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of uniqueness and local search in quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving a (0, 1) hyperbolic program by branch and bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Local Search Problems that are Hard to Solve / rank
 
Normal rank
Property / cites work
 
Property / cites work: Global optimization of 0-1 hyperbolic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP is as easy as detecting unique solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on a global approach for general 0-1 fractional programming / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:05, 10 June 2024

scientific article
Language Label Description Also known as
English
On complexity of unconstrained hyperbolic 0--1 programming problems
scientific article

    Statements

    On complexity of unconstrained hyperbolic 0--1 programming problems (English)
    0 references
    0 references
    0 references
    0 references
    1 June 2005
    0 references
    0 references
    Hyperbolic 0-1 programming
    0 references
    Complexity
    0 references
    Uniqueness
    0 references
    Local search
    0 references
    Approximability
    0 references
    0 references