Results 21 to 30 of about 23,957 (296)
Cutting rectangles in the plane
AbstractLet F be a planar family of pairwise disjoint translates of a parallelogram. It is shown that if every four members of F are intersected by some straight line, then there is a straight line which intersects all but at most two members of F. If it is instead assumed that every two members of F are intersected by some line that is parallel to one
Meir Katchalski, Ted Lewis 0001
openaire +2 more sources
Molecular dynamics simulations of nanometric cutting on monocrystalline germanium are conducted to investigate the subsurface deformation during and after nanometric cutting.
Min Lai, Xiaodong Zhang, Fengzhou Fang
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
Depth lower bounds in Stabbing Planes for combinatorial principles [PDF]
Stabbing Planes (also known as Branch and Cut) is a proof system introduced very recently which, informally speaking, extends the DPLL method by branching on integer linear inequalities instead of single variables.
Stefan Dantchev +3 more
doaj +1 more source
Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem [PDF]
The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well- known (and strongly N P -hard) combinatorial optimization problem with many applications.
Kaparis, Konstantinos +2 more
core +1 more source
An alternating linearization bundle method for a class of nonconvex nonsmooth optimization problems
In this paper, we propose an alternating linearization bundle method for minimizing the sum of a nonconvex function and a convex function, both of which are not necessarily differentiable. The nonconvex function is first locally “convexified” by imposing
Chunming Tang, Jinman Lv, Jinbao Jian
doaj +1 more source
MODELING OF ROUGH ROTARY MILLING OF CRANKSHAFT PINS [PDF]
The development of the modern automotive industry requires a quick adaptation of new production methods. This is possible thanks to software capable of simulating manufacturing processes.
Kacper CIEŚLAR, Stanisław PŁONKA
doaj +1 more source
Cutting a Bunch of Grapes by a Plane
Let \({\mathcal B}_n\) be a family of \(n\) disjoint balls in \(d\)-dimensional euclidean space \(\mathbb{R}^d\). If \(d=2\) the term disk is used in place of ball. The max-min ratio of \({\mathcal B}_n\) is the ratio \(\lambda\) of the maximum radius divided by the minimum radius among the balls of \({\mathcal B}_n\). The authors prove two interesting
Hiroshi Maehara, Ai Oshiro
openaire +1 more source
Understanding Cutting Planes for QBFs [PDF]
We define a cutting planes system CP+8red 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, our ...
Chew, Leroy +7 more
core +1 more source
A Static Voltage Security Region for Centralized Wind Power Integration—Part I: Concept and Method
When large wind farms are centrally integrated in a power grid, cascading tripping faults induced by voltage issues are becoming a great challenge. This paper therefore proposes a concept of static voltage security region to guarantee that the voltage ...
Tao Ding +4 more
doaj +1 more source

