Results 31 to 40 of about 23,957 (296)
The Space Complexity of Cutting Planes Refutations [PDF]
, 2015 We study the space complexity of the cutting planes proof system, in which the lines in a proof are integral linear inequalities. We measure the space used by a refutation as the number of linear inequalities that need to be kept on a blackboard while ...
Thapen, Neil +5 more
core +1 more source
Infeasibility Cutting Plane for Unit Commitment Problem
CSEE Journal of Power and Energy SystemsThis paper introduces a new type of cutting plane for the unit commitment (UC) problem, namely “infeasibility cutting plane”. The infeasibility cutting plane refers to a type of logic constraint that eliminates the combination of integer ...
Shengpeng Qu, Zhifang Yang
doaj +1 more source
Journal of Functional Biomaterials, 2022 This study assesses the accuracy and technical predictability of a computer-guided procedure for harvesting bone from the external oblique ridge using a patient-specific cutting guide.
Luca De Stavola +6 more
doaj +1 more source
Cutting Planes in Combinatorics
European Journal of Combinatorics, 1985 The author uses two combinatorial problems: packing diamonds into a Chinese checkerboard nd Deza's proof of a conjecture of Erdős and Lovàsz [\textit{M. Deza}, J. Comb. Theory, Ser. B, 16, 166-167 (1974; Zbl 0263.05007)] to illustrate how Gomory's cutting plane method for solving integer linear programming problems can be used to solve combinatorial ...
openaire +2 more sources
A version of the penalty method with approximation of the epigraphs of auxiliary functions
Учёные записки Казанского университета: Серия Физико-математические науки, 2019 A method for solving the convex programming problem, which is ideologically close to the known methods of external penalties, was proposed. The method uses auxiliary functions that are built on the general form of the penalty functions.
I.Ya. Zabotin, K.E. Kazaeva
doaj +1 more source
EURO Journal on Computational Optimization, 2023 In this paper, two new algorithms for dual decomposition-based distributed optimization are presented. Both algorithms rely on the quadratic approximation of the dual function of the primal optimization problem.
Vassilios Yfantis +4 more
doaj +1 more source
Cutting Force Prediction in Drilling of Titanium Alloy
Journal of Advanced Mechanical Design, Systems, and Manufacturing, 2012 Cutting force in drilling of Ti-6Al-4V is studied with simulation based on a predictive model. In the force model, three-dimensional chip flow is made by piling up the orthogonal cuttings in the planes containing the cutting velocities and the chip flow ...
Shoichi TAMURA +2 more
doaj +1 more source
The Number of Plane Corner Cuts
Advances in Applied Mathematics, 1999 An \(n\)-element subset \(\lambda\) of \(\mathbb{N}^2\) which is cut off a line is called a (plane) corner cut of size \(n\). Let be \({\mathbb{N}^2\choose n}_{ \text{cut}}\) the set of corner cuts of size \(n\). [See \textit{S. Onn} and \textit{B. Sturmfels}, ibid., 29-48 (1999; above).] The authors give a generating for the number \(\#{\mathbb{N}^2 ...
Corteel, Sylvie +3 more
openaire +1 more source
Health Literacy, Self‐Efficacy and Knowledge of Sickle Cell Disease Among Caregivers
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Sickle cell disease (SCD) is a hereditary blood disorder in which abnormal haemoglobin leads to severe anaemia, painful crises and organ failure. Caregivers’ health literacy (HL) – their ability to assess, understand and apply information, and interact with healthcare professionals – is crucial for managing children with SCD, yet ...
Melanie Bruinooge +6 more
wiley +1 more source
On Using Cutting Planes in Pseudo-Boolean Optimization [PDF]
, 2006 Cutting planes are a well-known, widely used, and very eective technique for Integer Linear Programming (ILP). However, cutting plane techniques are seldom used in Pseudo-Boolean Optimization (PBO) algorithms.
Marques-Silva, J. P. +3 more
core