Results 11 to 20 of about 1,171,807 (293)
Cutting plane methods for general integer programming [PDF]
, 1993 Integer programming (IP) problems are difficult to solve due to the integer restrictions imposed on them. A technique for solving these problems is the cutting plane method.
Mitra, G +5 more
core +6 more sources
Cutting Plane and Frege Proofs
Information and Computation, 1995 The cutting plane refutation system CP for classical propositional calculus [see \textit{W. Cook}, \textit{C. R. Coullard} and \textit{Gy. Turan}, Discrete Appl. Math. 18, 25-38 (1987; Zbl 0625.90056)], initially coming from works in operation research, can be considered as an extension of resolution based on showing the non-existence of solutions for ...
Clote, P., Peter Clote
openaire +4 more sources
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 +6 more sources
Volumetric Barrier Cutting Plane Algorithms for Stochastic Linear Semi-Infinite Optimization
IEEE Access, 2020 In this paper, we study the two-stage stochastic linear semi-infinite programming with recourse to handle uncertainty in data defining (deterministic) linear semi-infinite programming.
Baha Alzalg, Asma Gafour, Lewa Alzaleq
doaj +1 more source
, 1980 We give a geometrical description of Chvatal's version of Gomory's cutting plane method. Restricting ourselves to rational spaces, we prove that the derived geometrical objects are polyhedra again, and that the method also works for unbounded polyhedra.
Schrijver, A, Schrijver, A
openaire +3 more sources
Experimental study on optimization of PDC cutting teeth for conglomerate layer
Jin'gangshi yu moliao moju gongcheng, 2023 In order to obtain better drilling effect in the conglomerate layer, it is necessary to optimize the tooth shape and caster angle of PDC bit for the conglomerate layer. Single tooth rock breaking experiments are conducted on ordinary plane teeth, conical
Shuting CHENG +4 more
doaj +3 more sources
On Constants for Cuttings in the Plane [PDF]
Discrete & Computational Geometry, 1998 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source
A New Efficient Algorithm for Hazardous Material Transportation Problem via Lane Reservation
IEEE Access, 2019 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
Automating cutting planes is NP-hard [PDF]
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020 Full version of the conference version at STOC 2020 by the same ...
Mika Göös +3 more
openaire +3 more sources
Вестник СибАДИ, 2020 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