One approach to constructing cutting algorithms with dropping of cutting planes
From MaRDI portal
Recommendations
- A cutting method for finding discrete minimax with dropping of cutting planes
- A minimization method with approximation of feasible set and epigraph of objective function
- A cutting-plane method without inclusions of approximating sets for conditional minimization
- A cutting method and construction of mixed minimization algorithms on its basis
- A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
Cited in
(10)- A cutting-plane method without inclusions of approximating sets for conditional minimization
- A cutting method with approximation of a constraint region and an epigraph for solving conditional minimization problems
- Constrained integer fractional programming problem with box constraints
- A cutting method and construction of mixed minimization algorithms on its basis
- Constructing mixed algorithms on the basis of some bundle method
- Cutting planes and column generation techniques with the projective algorithm
- A minimization method with approximation of feasible set and epigraph of objective function
- Evaluation of algorithms for one-dimensional cutting
- Cutting planes and the parameter cutwidth
- A cutting method for finding discrete minimax with dropping of cutting planes
This page was built for publication: One approach to constructing cutting algorithms with dropping of cutting planes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q353915)
