mt_T2.h File Reference

Detailed Description

Definition in file mt_T2.h.

#include "EGlib.h"
#include "mt_gomory.h"
#include "mt_cplex_cbk.h"
#include "mt_cutpool.h"
#include "mt_tableau.h"

Include dependency graph for mt_T2.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions

int MTt2_ccbk (CPXCENVptr env, void *cbdata, int wherefrom, void *cbhandle, int *useraction_p)

Interface for the CPLEX-callback for the MTt2Cut function.

int MTt2Cut (const MTrowmatrix_t *const tb, MTlp_t *const lp, MTcutHeap_t *const cuth, const double *const f, double *const extcut, double *const work, const int cut_style)

compute the best cuts found using T2 sets as a base, where
$T2_n=\left\{x\in\mathbb{R}^n: \begin{matrix} R1:&-x_1 & \leq 0\\ R2:& x_1-x_2 & \leq 1\\ R3:& x_1+x_2-x_3 & \leq 2\\ \vdots & \vdots & \vdots\\ Rn:& x_1+\ldots+x_{n-1}-x_n&\leq n-1\\ R(n+1):& x_1+\ldots+x_{n-1}+x_n&\leq n\\ \end{matrix}\right\}$
, and where we try all possible $n!2^n$ reorientation of the axis and permutation of the rows. Note that we assume that all variables are continuous, and that the tableau represent the (vectorial) equation
$\vec{x} = \vec{f}+\frac12\vec{1} +\sum\limits_{i\in I}s_i\vec{r_i},$
where $\displaystyle\vec{x}\in\mathbb{Z}^m$ , $\displaystyle\vec{f}\in\left]-\frac12,\frac12\right[^m$ , $\displaystyle\vec{r_i}\in\mathbb{R}^m,\forall i\in I$ , $s\displaystyle _i\in\mathbb{R}_+,\forall i\in I$ ; and where $\displaystyle m=$ nrows and $\displaystyle |I|=$ ncols.

Generated on Mon Oct 26 09:16:53 2009 for MTgomory by

1.4.6


Functions
int	MTt2_ccbk (CPXCENVptr env, void cbdata, int wherefrom, void cbhandle, int *useraction_p)
	Interface for the CPLEX-callback for the MTt2Cut function.
int	MTt2Cut (const MTrowmatrix_t const tb, MTlp_t const lp, MTcutHeap_t const cuth, const double const f, double const extcut, double const work, const int cut_style)
	compute the best cuts found using T2 sets as a base, where $T2_n=\left\{x\in\mathbb{R}^n: \begin{matrix} R1:&-x_1 & \leq 0\\ R2:& x_1-x_2 & \leq 1\\ R3:& x_1+x_2-x_3 & \leq 2\\ \vdots & \vdots & \vdots\\ Rn:& x_1+\ldots+x_{n-1}-x_n&\leq n-1\\ R(n+1):& x_1+\ldots+x_{n-1}+x_n&\leq n\\ \end{matrix}\right\}$ , and where we try all possible reorientation of the axis and permutation of the rows. Note that we assume that all variables are continuous, and that the tableau represent the (vectorial) equation $\vec{x} = \vec{f}+\frac12\vec{1} +\sum\limits_{i\in I}s_i\vec{r_i},$ where $\displaystyle\vec{x}\in\mathbb{Z}^m$ , $\displaystyle\vec{f}\in\left]-\frac12,\frac12\right[^m$ , $\displaystyle\vec{r_i}\in\mathbb{R}^m,\forall i\in I$ , $s\displaystyle _i\in\mathbb{R}_+,\forall i\in I$ ; and where $\displaystyle m=$ nrows and $\displaystyle \|I\|=$ ncols.