Permeability prediction of 3D complex fracture networks in deep underground based on fractal analysis of trace maps [PDF]
Estimating the permeability of a three-dimensional (3D) discrete fracture network (DFN) based on its geometric properties can provide a useful alternative to the resource-intensive direct hydraulic computation of the 3D DFN.
Jing Zhang +4 more
doaj +2 more sources
Iatrogenic coronal-sagittal coupling driven by a 12.4° rotational mismatch in manual total knee arthroplasty and precise decoupling with robotic assistance: a radiographic retrospective cohort study [PDF]
Background Achieving precise reconstruction of both the coronal and sagittal planes is pivotal in total knee arthroplasty (TKA). However, conventional manual TKA (M-TKA) may induce an unintended “coronal-sagittal coupling” effect, where adjustments in ...
Hongxu Li +7 more
doaj +2 more sources
The global mixed-integer quadratic optimizer, GloMIQO, addresses mixed-integer quadratically constrained quadratic programs (MIQCQP) to ε-global optimality. This paper documents the branch-and-cut framework integrated into GloMIQO 2.
Ruth Misener, Christodoulos A Floudas
exaly +2 more sources
General Cutting Planes for Bound-Propagation-Based Neural Network Verification [PDF]
Bound propagation methods, when combined with branch and bound, are among the most effective methods to formally verify properties of deep neural networks such as correctness, robustness, and safety. However, existing works cannot handle the general form
Huan Zhang +7 more
semanticscholar +1 more source
Machine Learning for Cutting Planes in Integer Programming: A Survey [PDF]
We survey recent work on machine learning (ML) techniques for selecting cutting planes (or cuts) in mixed-integer linear programming (MILP). Despite the availability of various classes of cuts, the task of choosing a set of cuts to add to the linear ...
Arnaud Deza, Elias Boutros Khalil
semanticscholar +1 more source
Complexity of Branch-and-Bound and Cutting Planes in Mixed-Integer Optimization — II [PDF]
We study the complexity of cutting planes and branching schemes from a theoretical point of view. We give some rigorous underpinnings to the empirically observed phenomenon that combining cutting planes and branching into a branch-and-cut framework can ...
A. Basu +3 more
semanticscholar +1 more source
Cutting planes based relaxed optimal power flow in active distribution systems
Youbo Liu, Lingfeng Wang, Hongjun Gao
exaly +2 more sources
Automating cutting planes is NP-hard [PDF]
We show that Cutting Planes (CP) proofs are hard to find: Given an unsatisfiable formula F, It is -hard to find a CP refutation of F in time polynomial in the length of the shortest such refutation; and unless Gap-Hitting-Set admits a nontrivial ...
Mika Göös +3 more
semanticscholar +1 more source
Core-guided techniques have revolutionized Boolean satisfiability approaches to optimization problems (MaxSAT), but the process at the heart of these methods, strengthening bounds on solutions by repeatedly adding cardinality constraints, remains a ...
Jo Devriendt +4 more
semanticscholar +1 more source
An experimental study on shear bands in sand using the orthogonal cutting setup [PDF]
We study the evolution of shear bands in granular media subjected to very large deformations using the orthogonal cutting geometry. We perform our cutting experiments on Cauvery Delta sand with d50 of 0.45mm. We also capture images of the cutting process
Hegde Abhijit, Murthy Tejas
doaj +1 more source

