Results 241 to 250 of about 327,426 (292)
Research on CNC machining technology of straight bevel gears based on hypocycloids. [PDF]
Sci RepTian C, Wang T, Tian Y, Zhang X.
europepmc +1 more source
Influence of HFCVD Parameters on Diamond Coatings and Process Investigation of Sapphire Wafer Lapping. [PDF]
Materials (Basel)Feng W, Zhou S, Sun X.
europepmc +1 more source
A logarithmic barrier cutting plane method for convex programming [PDF]
Annals of Operations Research, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hertog, D. den +3 more
openaire +4 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Cutting-plane method based on epigraph approximation with discarding the cutting planes
Automation and Remote Control, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zabotin I., Yarullin R.
openaire +4 more sources
2000
In this chapter, we introduce a class of methods that were among the first to be designed for the solution of integer programming problems. Throughout the past decades, however, computational evidence has revealed that cutting planes, while appealing from a theoretical point of view, do not appear to work very well if applied to general integer ...
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
In this chapter, we introduce a class of methods that were among the first to be designed for the solution of integer programming problems. Throughout the past decades, however, computational evidence has revealed that cutting planes, while appealing from a theoretical point of view, do not appear to work very well if applied to general integer ...
H. A. Eiselt, C.-L. Sandblom
openaire +1 more source
2014
Subgradient methods described in the previous chapter use only one arbitrary subgradient (generalized gradient) at a time, without memory of past iterations. If the information from previous iterations is kept, it is possible to define a model—the so-called cutting plane model—of the objective function.
Adil Bagirov +2 more
openaire +1 more source
Subgradient methods described in the previous chapter use only one arbitrary subgradient (generalized gradient) at a time, without memory of past iterations. If the information from previous iterations is kept, it is possible to define a model—the so-called cutting plane model—of the objective function.
Adil Bagirov +2 more
openaire +1 more source
Cutting-Plane Methods without Nested Constraint Sets
Operations Research, 1970This paper gives general conditions for the convergence of a class of cutting-plane algorithms without requiring that the constraint sets for the sub-problems be sequentially nested. Conditions are given under which inactive constraints may be dropped after each subproblem.
openaire +2 more sources
Polynomial Interior Point Cutting Plane Methods
Optimization Methods and Software, 2003Polynomial cutting plane methods based on the logarithmic barrier function and on the volumetric center are surveyed. These algorithms construct a linear programing relaxation of the feasible region, find an appropriate approximate center of the region, and call a separation oracle at this approximate center to determine whether additional constraints ...
openaire +1 more source
Cutting-Plane Theory: Disjunctive Methods
1977This paper is a survey, with new results, of the disjunctive methods of cutting-plane theory, which were devised by Balas, Glover, Owen, Young, and other researchers, over the past half decade. The basic disjunctive cut principle is derived, its interrelations with the other cut-producing procedures are discussed, and applications of it are given. Many
openaire +1 more source