Results 1 to 10 of about 2,078,237 (349)
IEEE Access, 2020 Benefiting from the characteristics of full field scanning, high resolution and high precision, digital fringe projection measurement technology has been widely used in three-dimensional measurement.
Changzhi Yu, Fang Ji, Junpeng Xue
doaj +2 more sources
Using projected cutting planes in the extended cutting plane method [PDF]
Optimization, 2021 In this paper we show that simple projections can improve the algorithmic performance of cutting plane-based optimization methods.
Westerlund Tapio +2 more
openaire +5 more sources
Learning To Cut By Looking Ahead: Cutting Plane Selection via Imitation Learning [PDF]
International Conference on Machine Learning, 2022 Cutting planes are essential for solving mixed-integer linear problems (MILPs), because they facilitate bound improvements on the optimal solution value.
Max B. Paulus +4 more
semanticscholar +1 more source
An improved cutting plane method for convex optimization, convex-concave games, and its applications [PDF]
Symposium on the Theory of Computing, 2020 Given a separation oracle for a convex set K ⊂ ℝ n that is contained in a box of radius R, the goal is to either compute a point in K or prove that K does not contain a ball of radius є.
Haotian Jiang +3 more
semanticscholar +1 more source
Anisotropic micro cutting of rolled titanium alloy
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2023 In machining of rolled titanium alloy, the anisotropy in the cutting force induced by the rolling texture should be controlled to achieve high quality surface.
Shoichi TAMURA +3 more
doaj +1 more source
SIAM Journal on Optimization, 2021 We provide a polynomial time cutting plane algorithm based on split cuts to solve integer programs in the plane. We also prove that the split closure of a polyhedron in the plane has polynomial size.
Basu A. +3 more
openaire +3 more sources
Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems
Algorithms, 2023 The Bundle Enrichment Method (BEM-DC) is introduced for solving nonsmooth difference of convex (DC) programming problems. The novelty of the method consists of the dynamic management of the bundle.
Manlio Gaudioso +3 more
doaj +1 more source
Understanding cutting planes for QBFs [PDF]
Information and Computation, 2018 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Olaf Beyersdorff +3 more
openaire +6 more sources
Preprocessing and cutting planes with conflict graphs [PDF]
Computers & Operations Research, 2021 This paper addresses the development of conflict graph-based algorithms and data structures into the COIN-OR Branch-and-Cut (CBC) solver, including: $(i)$ an efficient infrastructure for the construction and manipulation of conflict graphs; $(ii)$ a preprocessing routine based on a clique strengthening scheme that can both reduce the number of ...
Samuel Souza Brito +1 more
openaire +2 more sources
ℓ
IEEE Access, 2020 Existing multiple kernel learning (MKL) algorithms indiscriminately apply the same set of kernel combination weights to all samples by pre-specifying a group of base kernels.
Qiang Wang, Xinwang Liu, Jiaqing Xu
doaj +1 more source