Results 251 to 260 of about 1,171,807 (293)

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

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

cutting|Plane

Proceedings of the 2008 C3S2E conference on - C3S2E '08, 2008
The interpretation of results of analysis often requires considerable resources; both hardware and human expertise and time. Many disciplines generate three-dimensional volume datasets that need to be explored to observe structure and trends in key variables.
openaire   +1 more source

Multiple Cuts in the Analytic Center Cutting Plane Method

SIAM Journal on Optimization, 2000
Summary: We analyze the multiple cut generation scheme in the analytic center cutting plane method. We propose an optimal primal and dual updating direction when the cuts are central. The direction is optimal in the sense that it maximizes the product of the new dual slacks and of the new primal variables within the trust regions defined by Dikin's ...
Jean-Louis Goffin, Jean-Philippe Vial
openaire   +1 more source

Cancelling cuts in the regge plane

Physics Letters, 1963
The application of the unitary condition in crossed channels suggests the possibility of cuts in the Regge plane. An example from perturbation theory is given in which cancellations between separate terms in the unitary sum removes unwelcome singularities. (C.E.S.)
openaire   +1 more source

Corner Polyhedra and their connection with cutting planes

Mathematical Programming, 2003
Corner polyhedra [\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)] are polyhedra associated to certain relaxations of an integer programming problem.
Ralph E. Gomory, Ellis L. Johnson, Lisa Evans   +2 more
openaire   +1 more source

Cutting planes for branch‐and‐price algorithms

Networks, 2011
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.
Guy Desaulniers, Jacques Desrosiers, Simon Spoorendonk   +2 more
openaire   +1 more source

Solving Quadratic Programming by Cutting Planes

SIAM Journal on Optimization, 2019
Summary: We propose new cutting planes for strengthening the linear relaxations that appear in the solution of nonconvex quadratic problems with linear constraints. By a famous result of Motzkin and Straus, these problems are connected to the clique number of a graph.
Bonami P., Lodi A., Schweiger J., Tramontani A.   +3 more
openaire   +3 more sources