A Polynomial Algorithm for a Class of 0–1 Fractional Programming Problems Involving Composite Functions, with an Application to Additive Clustering

Semi-infinite minimax fractional programming problems with both inequality and equality constraints are considered. The sets of parametric saddle point conditions are established for a new class of nonconvex differentiable semi-infinite minimax fractional programming problems under(?,?)-invexity assumptions. With the reference to the said concept of generalized convexity, we extend some results of saddle point criteria for a larger class of nonconvex semi-infinite minimax fractional programming problems in comparison to those ones previously established in the literature.

Download Full-text

A Polynomial Algorithm with Asymptotic Ratio $$\boldsymbol {2/3}$$ for the Asymmetric Maximization Version of the $$\boldsymbol m $$-PSP

Journal of Applied and Industrial Mathematics ◽

10.1134/s1990478920030059 ◽

2020 ◽

Vol 14 (3) ◽

pp. 456-469

Author(s):

A. N. Glebov ◽

S. G. Toktokhoeva

Keyword(s):

Polynomial Algorithm

Download Full-text

A polynomial algorithm of edge-neighbor-scattering number of trees

Applied Mathematics and Computation ◽

10.1016/j.amc.2016.02.021 ◽

2016 ◽

Vol 283 ◽

pp. 1-5 ◽

Cited By ~ 1

Author(s):

Yong Liu ◽

Zongtian Wei ◽

Jiarong Shi ◽

Anchan Mai

Keyword(s):

Polynomial Algorithm

Download Full-text

A new solution approach to the uncertain multi-objective linear fractional programming problems

10.1063/5.0025256 ◽

2020 ◽

Author(s):

A. N. Revathi ◽

S. Mohanaselvi

Keyword(s):

Fractional Programming ◽

Linear Fractional Programming ◽

Solution Approach ◽

Multi Objective

Download Full-text

A parametric solution method for a generalized fractional programming problem

Indian Journal of Pure and Applied Mathematics ◽

10.1007/s13226-021-00102-y ◽

2021 ◽

Author(s):

YongJin Kim ◽

YunChol Jong ◽

JinWon Yu

Keyword(s):

Programming Problem ◽

Fractional Programming ◽

Solution Method ◽

Parametric Solution ◽

Generalized Fractional Programming ◽

Fractional Programming Problem

Download Full-text

Reduction of the integer factorization complexity upper bound to the complexity of the Diffie–Hellman problem

Discrete Mathematics and Applications ◽

10.1515/dma-2021-0001 ◽

2021 ◽

Vol 31 (1) ◽

pp. 1-4

Author(s):

Mikhail A. Cherepnev

Keyword(s):

Upper Bound ◽

Polynomial Algorithm ◽

Integer Factorization ◽

Factorization Problem ◽

Diffie Hellman ◽

Integer Factorization Problem

Abstract We construct a probabilistic polynomial algorithm that solves the integer factorization problem using an oracle solving the Diffie–Hellman problem.

Download Full-text