Routing in grid graphs by cutting planes

1995 ◽  
Vol 41 (3) ◽  
pp. 255-275 ◽  
Author(s):  
Martin Gr�tschel ◽  
Alexander Martin ◽  
Robert Weismantel
Keyword(s):  
Cutting Planes ◽  
Grid Graphs

scholarly journals Peg Solitaire on Cartesian Products of Graphs

2021 ◽  
Vol 37 (3) ◽  
pp. 907-917
Author(s):  
Martin Kreh ◽  
Jan-Hendrik de Wiljes
Keyword(s):  
Cartesian Product ◽  
Cartesian Products ◽  
Connected Graphs ◽  
Grid Graphs ◽  
Cartesian Products Of Graphs

AbstractIn 2011, Beeler and Hoilman generalized the game of peg solitaire to arbitrary connected graphs. In the same article, the authors proved some results on the solvability of Cartesian products, given solvable or distance 2-solvable graphs. We extend these results to Cartesian products of certain unsolvable graphs. In particular, we prove that ladders and grid graphs are solvable and, further, even the Cartesian product of two stars, which in a sense are the “most” unsolvable graphs.

Cutting planes for mixed-integer knapsack polyhedra

1998 ◽  
Vol 81 (2) ◽  
pp. 257-262 ◽  
Author(s):  
Xiao-Qing Yan ◽  
E. Andrew Boyd
Keyword(s):  
Cutting Planes ◽  
Mixed Integer

scholarly journals A linear-time algorithm for the longest path problem in rectangular grid graphs

2012 ◽  
Vol 160 (3) ◽  
pp. 210-217 ◽  
Author(s):  
Fatemeh Keshavarz-Kohjerdi ◽  
Alireza Bagheri ◽  
Asghar Asgharian-Sardroud
Keyword(s):  
Linear Time ◽  
Time Algorithm ◽  
Linear Time Algorithm ◽  
Rectangular Grid ◽  
Grid Graphs ◽  
Longest Path ◽  
Longest Path Problem

Computational Experience with Applications of Bilinear Cutting Planes

2013 ◽  
Vol 52 (22) ◽  
pp. 7514-7525 ◽  
Author(s):  
Keith Zorn ◽  
Nikolaos V. Sahinidis
Keyword(s):  
Cutting Planes ◽  
Computational Experience

Study about the Stone Curves and the Development of Polygonal Shape Cutting Device

2014 ◽  
Vol 1025-1026 ◽  
pp. 85-88 ◽  
Author(s):  
Sung Hoon Oh
Keyword(s):  
Cutting Planes ◽  
Working Time ◽  
Path Generation ◽  
Control Module ◽  
Positioning Control ◽  
Large Size ◽  
Design Program ◽  
Polygonal Shape ◽  
The Temple

Through this study, equipment was developed which could work large size stones into linear and curve shaped cutting planes and cut polygonal shaped stones during the lapping and semi-finishing works which are pre-tasks to manufacture the large size building column or large size stone statue which is installed in the temple. The best is to read these instructions and follow the outline of this text. Safety of equipment could be secured using design program and structure interpreting program and productivity could be improved by reducing the required manpower and working time for rough grinding and semi-finishing works through positioning control module. This technology is expected to be utilized in manufacturing various stone equipments by applying the working path generation and oil pressure technologies as the type of NC work equipments as well as in future working area.

Strong lift-and-project cutting planes for the stable set problem

2012 ◽  
Vol 141 (1-2) ◽  
pp. 165-192 ◽  
Author(s):  
Monia Giandomenico ◽  
Fabrizio Rossi ◽  
Stefano Smriglio
Keyword(s):  
Cutting Planes ◽  
Stable Set ◽  
Strong Lift ◽  
Stable Set Problem
Sign in / Sign up

Export Citation Format

Share Document