Results 21 to 30 of about 2,078,237 (349)
Automating cutting planes is NP-hard [PDF]
Full version of the conference version at STOC 2020 by the same ...
Mika Göös +3 more
openaire +3 more sources
A New Efficient Algorithm for Hazardous Material Transportation Problem via Lane Reservation
Hazardous material transportation is well-known for its high potential risk. Minimizing the transportation risk is an important issue for hazardous material transportation. This paper focuses on a novel algorithm for the hazardous material transportation
Zhen Zhou +4 more
doaj +1 more source
A key step in solving minimax distributionally robust optimization (DRO) problems is to reformulate the inner maximization w.r.t. probability measure as a semiinfinite programming problem through Lagrange dual.
Huifu Xu, Yongchao Liu, Hailin Sun
semanticscholar +1 more source
An optimal variant of Kelley’s cutting-plane method [PDF]
We propose a new variant of Kelley’s cutting-plane method for minimizing a nonsmooth convex Lipschitz-continuous function over the Euclidean space.
Y. Drori, M. Teboulle
semanticscholar +1 more source
Primal cutting plane algorithms revisited [PDF]
Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well known and form the basis of the highly successful branch-and-cut method.
Lodi, A., Letchford, A. N.
core +3 more sources
Introduction. To solve the problem of accelerating the construction of roads, improving their quality, it is advisable to use a continuous action unit to form a underlying layer.
V. A. Nikolaev
doaj +1 more source
A concise, efficient continuous-wave eye-safe Nd:GdVO4/KGW Raman laser at 1525 nm is here demonstrated. A Nd:GdVO4 crystal was used to produce the fundamental field at 1341 nm and a KGW crystal generated the intracavity Stokes field at 1525 nm via ...
Hsin-Jia Huang +5 more
doaj +1 more source
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
Stochastic programming with multivariate second order stochastic dominance constraints with applications in portfolio optimization [PDF]
In this paper we study optimization problems with multivariate stochastic dominance constraints where the underlying functions are not necessarily linear. These problems are important in multicriterion decision making, since each component of vectors can
Xu, Huifu +2 more
core +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source

