The Direct Power of Adjacent Vertex Programming Methods

Cited in

(41)

A chance constrained approach to fractional programming with random numerator
A dual non-linear program
A new look at fractional programming
Using convex envelopes to solve the interactive fixed-charge linear programming problem
On the structure and properties of a linear multilevel programming problem
Equivalent definitions of the quasiconvexity
Nine kinds of quasiconcavity and concavity
On pseudolinear functions
A bisection-extreme point search algorithm for optimizing over the efficient set in the linear dependence case
A note on the maximum of quasiconvace functions
Minimization of ratios
Goal programming and multiple objective optimizations. Part I
Dynamic lot-sizing with setup cost reduction
A note on solving multi-objective integer indefinite quadratic fractional programs
On the structure of the weakly efficient set for quasiconvex vector minimization
Local maximum points of explicitly quasiconvex functions
Strictly quasi-convex (concave) functions and duality in mathematical programming
Analysis of the solution to a linear fractional functionals programming
Indefinite quadratic fractional functional programming
The application of generalized Benders decomposition to certain nonconcave programs
Continuity of optimal solution functions and their conditions on objective functions
On Maximizing a Sum of Ratios
Indefinite Quadratic Solid Transportation Problem
Bibliography in fractional programming
A note on fractional interval programming
Lexicographic quasiconcave multiobjective programming
A relaxation algorithm for the minimization of a quasiconcave function on a convex polyhedron
Quasiconcave functions over chains^†
Ordinally Quasiconcave Functions^§
Bilevel problems over polyhedra with extreme point optimal solutions
Equivalence of various linearization algorithms for linear fractional programming
A primal-like algorithm for zero-one integer Fractional Programming Problem
AN ITERATIVE ALGORITHM FOR A CLASS OF NONLINEAR INTEGER BILEVEL PROGRAMMING PROBLEMS WITH BOX CONSTRAINTS
Maximization of the transmission rate of a discrete, constant channel
On duality in linear fractional functionals programming
Transportation technique in non-linear fractional programming
A note on maximization of the transmission rate of discrete, constant channel
C-programming and the minimization of pseudolinear and additive concave functions
Fractional programming
Optimization of a quadratic programming problem over an Integer efficient set
An algorithm to solve multi-objective integer quadratic programming problem

This page was built for publication: The Direct Power of Adjacent Vertex Programming Methods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5517443)