Pages that link to "Item:Q2263093"

The following pages link to A cutting method for finding discrete minimax with dropping of cutting planes (Q2263093):

Displaying 11 items.

• A cutting method with updating approximating sets and its combination with other algorithms (Q307748) (← links)
• One approach to constructing cutting algorithms with dropping of cutting planes (Q353915) (← links)
• On several algorithms of immersion - cutoff for the problem of mathematical programming (Q447686) (← links)
• A cutting-plane method without inclusions of approximating sets for conditional minimization (Q748232) (← links)
• A cutting plane method for solving minimax problems in the complex plane (Q1200545) (← links)
• Methods of embedding-cutting off in problems of mathematical programming (Q1959250) (← links)
• A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems (Q1990958) (← links)
• A minimization method with approximation of feasible set and epigraph of objective function (Q2363374) (← links)
• A cutting method and construction of mixed minimization algorithms on its basis (Q2815064) (← links)
• (Q4534090) (← links)
• One variant of the objective function parameterization method and its implementation (Q6040381) (← links)