Results 61 to 70 of about 2,078,237 (349)
Zero-one IP problems: Polyhedral descriptions & cutting plane procedures [PDF]
, 1994 A systematic way for tightening an IP formulation is by employing classes of linear inequalities that define facets of the convex hull of the feasible integer points of the respective problems.
Mitra, G, Yarrow, L, Abdul-Hamid, F
core
Parallel cutting plane algorithms for inverse mixed integer linear programming [PDF]
, 2009 We present parallel cutting plane algorithms for the inverse mixed integer linear programming problem (InvMILP), which are extended algorithms of the cutting plane algorithms for InvMILP.
Duan, Zhaoyang, Zhaoyang Duan
core +2 more sources
An Approximate Proximal Bundle Method to Minimize a Class of Maximum Eigenvalue Functions
Journal of Applied Mathematics, 2014 We present an approximate nonsmooth algorithm to solve a minimization problem, in which the objective function is the sum of a maximum eigenvalue function of matrices and a convex function.
Wei Wang +3 more
doaj +1 more source
Impact of Metastatic Patterns on Survival and Response to Therapy in Neuroblastoma
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background While the presence of metastases in neuroblastoma (NB) is a well‐established prognostic factor, the clinical significance of dissemination patterns and tumour burden and their impact on response and survival remains poorly understood.
Mariona Morell‐Daniel +15 more
wiley +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Although significant progress has been made in childhood leukemia survival, healthcare providers, and caregivers often face challenges in explaining this disease to patients. Disease‐targeted storybooks have been proposed as a tool to facilitate the understanding of diagnoses and treatment.
Nutvipha Ummartyotin +6 more
wiley +1 more source
Cutting Planes for Signomial Programming
SIAM Journal on OptimizationCutting planes are of crucial importance when solving nonconvex nonlinear programs to global optimality, for example using the spatial branch-and-bound algorithms. In this paper, we discuss the generation of cutting planes for signomial programming. Many global optimization algorithms lift signomial programs into an extended formulation such that these
Liding Xu +3 more
openaire +3 more sources
A Proximal Analytic Center Cutting Plane Algorithm for Solving Variational Inequality Problems
Journal of Applied Mathematics, 2012 Under the condition that the values of mapping F are evaluated approximately, we propose a proximal analytic center cutting plane algorithm for solving variational inequalities. It can be considered as an approximation of the earlier cutting plane method,
Jie Shen, Li-Ping Pang
doaj +1 more source
Therapeutic Apheresis and Dialysis, EarlyView.ABSTRACT Background Chronic micro‐inflammation in patients with end‐stage renal disease (ESRD) is a significant driver of cardiovascular complications and diminished quality of life. While standard hemodialysis (SHD) effectively manages small‐molecule clearance, its ability to remove medium‐to‐large uremic toxins—the primary catalysts of systemic ...
Hongwei Zuo +5 more
wiley +1 more source
Solving the Max-Cut Problem using Semidefinite Optimization in a Cutting Plane Algorithm. [PDF]
, 2008 A central graph theory problem that occurs in experimental physics, circuit layout, and computational linear algebra is the max-cut problem. The max-cut problem is to find a bipartition of the vertex set of a graph with the objective to maximize the ...
Sullivan, Eric Joseph
core
On the complexity of cutting-plane proofs
Discrete Applied Mathematics, 1987 As introduced by \textit{V. Chvatal} [Discrete Math. 4, 305-337 (1973; Zbl 0253.05131)] cutting planes provide a canonical way of proving that every integral solution of a given system of linear inequalities satisfies another specified inequality. In this note we make several observations on the complexity of such proofs in general and when restricted ...
William J. Cook +2 more
openaire +2 more sources