A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (Q1183334): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cost-reliability ratio path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ratio dynamic programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4134062 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal ratio spanning trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal Cost-Reliability Ratio Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial testing of the query ''Is \(a^ b\geq c^ d?''\) with application to finding a minimal cost reliability ratio spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5583694 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Nonlinear Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Classes of Two-Parameter Objectives Over Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: MINIMUM SPANNING TREE WITH NORMAL VARIATES AS WEIGHTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic spanning tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Some Properties of Programming Problems in Parametric form Pertaining to Fractional Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Stochastic Programming Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial time algorithm for a chance-constrained single machine scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parametric characterization and an \(\epsilon\)-approximation scheme for the minimization of a quasiconcave program / rank
 
Normal rank
Property / cites work
 
Property / cites work: VARIANCE CONSTRAINED MARKOV DECISION PROCESS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Optimization with Rational Objective Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4739657 / rank
 
Normal rank
Property / cites work
 
Property / cites work: C-programming problems: A class of non-linear optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: C-programming. An outline / rank
 
Normal rank

Latest revision as of 15:45, 15 May 2024

scientific article
Language Label Description Also known as
English
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems
scientific article

    Statements

    A fully polynomial time approximation scheme for minimum cost-reliability ratio problems (English)
    0 references
    0 references
    28 June 1992
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    polynomial time approximation scheme
    0 references
    minimum cost-reliability ratio problem
    0 references