Results 271 to 280 of about 2,777,990 (323)

Fenchel Cutting Planes for Integer Programs

Operations Research, 1994
A technique for generating cutting planes for integer programs is introduced that is based on the ability to optimize a linear function on a polyhedron rather than explicit knowledge of the underlying polyhedral structure of the integer program. The theoretical properties of the cuts and their relationship to Lagrangian relaxation are discussed, the ...
E Andrew Boyd
exaly   +4 more sources

Cutting Planes and the Parameter Cutwidth

Theory of Computing Systems, 2009
From the text: The system of Cutting Planes [\dots] provides a method for solving integer linear programs [\dots] by iteratively deriving further constraints until the problem is reduced to a general linear program (for which a polynomial algorithm is known). In terms of feasible solutions, this equates to isolating the integer hull of the solution set
Stefan S. Dantchev, Barnaby Martin
openaire   +2 more sources

Random Θ(log n)-CNFs Are Hard for Cutting Planes

IEEE Annual Symposium on Foundations of Computer Science, 2017
The random k-SAT model is the most important and well-studied distribution over k-SAT instances. It is closely connected to statistical physics and is a benchmark for satisfiability algorithms.
Noah Fleming, Denis Pankratov, T. Pitassi, Robert Robere   +3 more
semanticscholar   +1 more source

Scalable Neural Network Verification with Branch-and-bound Inferred Cutting Planes

Neural Information Processing Systems
Recently, cutting-plane methods such as GCP-CROWN have been explored to enhance neural network verifiers and made significant advances. However, GCP-CROWN currently relies on generic cutting planes (cuts) generated from external mixed integer programming
Duo Zhou, Christopher Brix, G. A. Hanasusanto, Huan Zhang   +3 more
semanticscholar   +1 more source

On semantic cutting planes with very small coefficients

Information Processing Letters, 2018
Cutting planes proofs for integer programs can naturally be defined both in a syntactic and in a semantic fashion. Filmus et al. (STACS 2016) proved that semantic cutting planes proofs may be exponentially stronger than syntactic ones, even if they use ...
Massimo Lauria, Neil Thapen
exaly   +2 more sources

Cutting-plane method based on epigraph approximation with discarding the cutting planes

Automation and Remote Control, 2015
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Zabotin I., Yarullin R.
openaire   +5 more sources

T-space and cutting planes

Mathematical Programming, 2003
The T-space [\textit{R. E. Gomory}, Some polyhedra related to combinatorial problems. Combinat. Struct. Appl., Proc. Calgary internat. Conf. combinat. Struct. Appl., Calgary 1969), 117 (1970; Zbl 0245.90019)] associated to an integer programming problem IP is the ambient space of integer coefficients of group elements of the group relaxation of IP.
Ralph E. Gomory, Ellis L. Johnson
openaire   +1 more source

Compression of arbitrary cutting planes

Proceedings DCC'99 Data Compression Conference (Cat. No. PR00096), 1999
Summary form only given. We present an efficient algorithm for compressing the data necessary to represent an arbitrary cutting plane extracted from a three-dimensional curvilinear data set. The cutting plane technique is an important visualization method for time-varying 3D simulation results since the data sets are often so large.
Yanlin Guan, Robert J. Moorhead
openaire   +1 more source

6: Cutting Planes

, 2015
W. J. Cook
semanticscholar   +2 more sources

Cutting planes for branch‐and‐price algorithms

Networks, 2009
AbstractThis article presents a general framework for formulating cutting planes in the context of column generation for integer programs. Valid inequalities can be derived using the variables of an equivalent compact formulation (i.e., the subproblem variables) or the master problem variables.
G. Desaulniers, J. Desrosiers, Simon Spoorendonk   +2 more
semanticscholar   +2 more sources