Results 281 to 290 of about 2,777,990 (323)
Some of the next articles are maybe not open access.
Proceedings of the 2008 C3S2E conference on - C3S2E '08, 2008
The interpretation of results of analysis often requires considerable resources; both hardware and human expertise and time. Many disciplines generate three-dimensional volume datasets that need to be explored to observe structure and trends in key variables.
openaire +1 more source
The interpretation of results of analysis often requires considerable resources; both hardware and human expertise and time. Many disciplines generate three-dimensional volume datasets that need to be explored to observe structure and trends in key variables.
openaire +1 more source
Multiple Cuts in the Analytic Center Cutting Plane Method
SIAM Journal on Optimization, 2000Summary: We analyze the multiple cut generation scheme in the analytic center cutting plane method. We propose an optimal primal and dual updating direction when the cuts are central. The direction is optimal in the sense that it maximizes the product of the new dual slacks and of the new primal variables within the trust regions defined by Dikin's ...
Jean-Louis Goffin, Jean-Philippe Vial
openaire +1 more source
Cancelling cuts in the regge plane
Physics Letters, 1963The application of the unitary condition in crossed channels suggests the possibility of cuts in the Regge plane. An example from perturbation theory is given in which cancellations between separate terms in the unitary sum removes unwelcome singularities. (C.E.S.)
openaire +1 more source
Corner Polyhedra and their connection with cutting planes
Mathematical Programming, 2003Corner polyhedra [\textit{R.E. Gomory}, Some polyhedra related to combinatorial problems. Combinat. Struct. Appl., Proc. Calgary internat. Conf. combinat. Struct. Appl., Calgary 1969), 117 (1970; Zbl 0245.90019)] are polyhedra associated to certain relaxations of an integer programming problem.
Ralph E. Gomory +2 more
openaire +1 more source
Complexity of branch-and-bound and cutting planes in mixed-integer optimization
Mathematical programming, 2022A. Basu +3 more
semanticscholar +1 more source
Cutting-Planes for Complementarity Constraints
SIAM Journal on Control and Optimization, 1978A characterization is given of all the cutting-planes for a generalized linear complementarity problem, in terms of rules whose repeated application yields exactly these valid implied inequalities.This report is a revision of our paper (1976), and our earlier proofs have been substantially simplified.
openaire +1 more source
On the complexity of cutting-plane proofs using split cuts
Operations Research Letters, 2010zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Finding the Right Cutting Planes for the TSP
ACM Journal of Experimental Algorithmics, 1999Given an instance of the Traveling Salesman Problem (TSP), a reasonable way to get a lower bound on the optimal answer is to solve a linear programming relaxation of an integer programming formulation of the problem. These linear programs typically have an exponential number of constraints, but in theory they can be solved efficiently with the ...
openaire +2 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