Results 11 to 20 of about 2,777,990 (323)
Understanding Cutting Planes for QBFs [PDF]
Information and Computation, 2018 We define a cutting planes system CP+ForallRed for quantified Boolean formulas (QBF) and analyse the proof-theoretic strength of this new calculus. While in the propositional case, Cutting Planes is of intermediate strength between resolution and Frege ...
Olaf Beyersdorff +3 more
semanticscholar +9 more sources
Achieving consistency with cutting planes [PDF]
Mathematical Programming, 2022 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
D. Davarnia +2 more
semanticscholar +5 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 +4 more sources
How Good Are Sparse Cutting-Planes? [PDF]
Conference on Integer Programming and Combinatorial Optimization, 2014 Sparse cutting-planes are often the ones used in mixed-integer programing (MIP) solvers, since they help in solving the linear programs encountered during branch-&-bound more efficiently.
S. Dey, M. Molinaro, Qian-Yi Wang
semanticscholar +3 more sources
Cutting plane methods for general integer programming [PDF]
, 1993 Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method.
Mitra, G, Hamid, FA, Darby-Dowman, K
core +6 more sources
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
DEDICATED CNC MILLING STRATEGIES FOR COMPLEX SURFACES [PDF]
Fiabilitate şi Durabilitate, 2023 The parts for the aerospace sector are complex, varied models, with above average hardness, heat treated, resistant to humidity and variable stress.
Adrian BUT, Cristian POPESCU, Lucian GAL
doaj
Strong Bounds for Resource Constrained Project Scheduling: Preprocessing and Cutting Planes [PDF]
Computers & Operations Research, 2019 Resource Constrained Project Scheduling Problems (RCPSPs) without preemption are well-known N P -hard combinatorial optimization problems. A feasible RCPSP solution consists of a time-ordered schedule of jobs with corresponding execution modes ...
Janniele A. S. Araujo +5 more
semanticscholar +1 more source
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 +4 more sources
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 +1 more source