Results 31 to 40 of about 2,777,990 (323)
Aggregation-based cutting-planes for packing and covering integer programs [PDF]
Mathematical programming, 2016 In this paper, we study the strength of Chvátal–Gomory (CG) cuts and more generally aggregation cuts for packing and covering integer programs (IPs). Aggregation cuts are obtained as follows: given an IP formulation, we first generate a single implied ...
Merve Bodur +4 more
semanticscholar +1 more source
On Constants for Cuttings in the Plane [PDF]
Discrete & Computational Geometry, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
An Innovative Experimental Study of Corner Radius Effect on Cutting Forces [PDF]
, 2014 The cutting forces are often modelled using edge discretisation methodology. In finish turning, due to the smaller corner radii, the use of a local cutting force model identified from orthogonal cutting tests poses a significant challenge. In this paper,
BISSEY BRETON, Stéphanie +4 more
core +1 more source
Modelling of cutting fibrous composite materials: current practice [PDF]
, 2015 Using fibre reinforced polymers (FRP) is increasing across many industries. Although FRP are laid-up in the near-net shape, several cutting operations are necessary to meet quality and dimensional requirements.
Kahwash, Fadi +5 more
core +1 more source
Cutting rectangles in the plane
Discrete Mathematics, 1982 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
Nanoscale Research Letters, 2017 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
SIAM Journal on Optimization, 2020 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Experimental investigation of hydrodynamics of melt layer during laser cutting of steel [PDF]
, 2011 In laser cutting process, understanding of hydrodynamics of melt layer is significant, because it is an important factor which controls the final quality. In this work, we observed hydrodynamics of melt layer on kerf front in the case of laser cutting of
Remy Fabbro +3 more
core +1 more source
Local and global lifted cover inequalities for the multidimensional knapsack problem [PDF]
, 2008 The 0-1 Multidimensional Knapsack Problem (0-1 MKP) is a well-known (and strongly NP-hard) combinatorial optimization problem with many applications. Up to now, the majority of upper bounding techniques for the 0-1 MKP have been based on Lagrangian or ...
Kaparis, Konstantinos, Letchford, A N
core +5 more sources
Depth lower bounds in Stabbing Planes for combinatorial principles [PDF]
Logical Methods in Computer ScienceStabbing 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