The Cutting Plane Method Is Polynomial for Perfect Matchings [PDF]
2012 IEEE 53rd Annual Symposium on Foundations of Computer Science, 2012 The cutting plane approach to finding minimum-cost perfect matchings has been discussed by several authors over past decades. Its convergence has been an open question. We develop a cutting plane algorithm that converges in polynomial-time using only Edmonds’ blossom inequalities, and which maintains half-integral intermediate LP solutions supported ...
Chandrasekaran, Karthekeyan +2 more
openaire +7 more sources
Estimation of specific cutting energy in an S235 alloy for multi-directional ultrasonic vibration-assisted machining using the Finite Element Method [PDF]
, 2020 The objective of this work is to analyze the influence of the vibration-assisted turning process on the machinability of S235 carbon steel. During the experiments using this vibrational machining process, the vibrational amplitude and frequency of the ...
Florez García, Luis Carlos +2 more
core +2 more sources
Asynchronous distributed charging protocol for plug-in electric vehicles
Journal of Economy and Technology, 2023 The proliferation of plug-in electric vehicles (PEVs) advocates a distributed paradigm for coordinating PEV charging. Unlike existing primal-dual decomposition or consensus methods, this paper proposes a cutting-plane-based distributed algorithm ...
Yunfan Zhang +3 more
doaj +1 more source
A redistributed cutting plane bundle-type algorithm for multiobjective nonsmooth optimization
AIMS Mathematics, 2022 I construct a new cutting-plane model for approximating nonsmooth nonconvex functions in multiobjective optimization and propose a new bundle-type method with the help of an improvement function.
Jia-Tong Li
doaj +1 more source
Solving variational inequalities defined on a domain with infinitely many linear constraints [PDF]
, 2007 We study a variational inequality problem whose domain is defined by infinitely many linear inequalities. A discretization method and an analytic center based inexact cutting plane method are proposed.
A.F. Veinott +31 more
core +2 more sources
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2018 This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method.
Dewi Suhika, Wamiliana Wamiliana
doaj +1 more source
Device for in-situ cleaving of hard crystals [PDF]
, 2005 Cleaving crystals in a vacuum chamber is a simple method for obtaining atomically flat and clean surfaces for materials that have a preferential cleaving plane.
A. Renner +4 more
core +2 more sources
Bundle Enrichment Method for Nonsmooth Difference of Convex Programming Problems
Algorithms, 2023 The Bundle Enrichment Method (BEM-DC) is introduced for solving nonsmooth difference of convex (DC) programming problems. The novelty of the method consists of the dynamic management of the bundle.
Manlio Gaudioso +3 more
doaj +1 more source
Analytic center cutting plane methods for variational inequalities over convex bodies
Journal of Inequalities and Applications, 2018 An analytic center cutting plane method is an iterative algorithm based on the computation of analytic centers. In this paper, we propose some analytic center cutting plane methods for solving quasimonotone or pseudomonotone variational inequalities ...
Renying Zeng
doaj +1 more source
Exact penalization, level function method, and modified cutting-plane method for stochastic programs with second order stochastic dominance constraints [PDF]
, 2013 Level function methods and cutting plane methods have been recently proposed to solve stochastic programs with stochastic second order dominance (SSD) constraints.
Meskarian, R., Sun, H., Wang, Y., Xu, H.
core +2 more sources