
The Circlet Inequalities: A New, CirculantBased FacetDefining Inequality for the TSP
Facetdefining inequalities of the symmetric Traveling Salesman Problem ...
read it

Total Coloring and Total Matching: Polyhedra and Facets
A total coloring of a graph G = (V, E) is an assignment of colors to ver...
read it

Windowed Prophet Inequalities
The prophet inequalities problem has received significant study over the...
read it

FRaGenLP: A Generator of Random Linear Programming Problems for Cluster Computing Systems
The article presents and evaluates a scalable FRaGenLP algorithm for gen...
read it

Extended formulation and valid inequalities for the multiitem inventory lotsizing problem with supplier selection
This paper considers the multiitem inventory lotsizing problem with su...
read it

Polyhedral Properties of the Induced Cluster Subgraphs
A cluster graph is a graph whose every connected component is a complete...
read it

MemComputing Integer Linear Programming
Integer linear programming (ILP) encompasses a very important class of o...
read it
A Polyhedral Study for the Cubic Formulation of the Unconstrained Traveling Tournament Problem
We consider the unconstrained traveling tournament problem, a sports timetabling problem that minimizes traveling of teams. Since its introduction about 20 years ago, most research was devoted to modeling and reformulation approaches. In this paper we carry out a polyhedral study for the cubic integer programming formulation by establishing the dimension of the integer hull as well as of faces induced by model inequalities. Moreover, we introduce a new class of inequalities and show that they are facetdefining. Finally, we evaluate the impact of these inequalities on the linear programming bounds.
READ FULL TEXT
Comments
There are no comments yet.