Sciweavers

4 search results - page 1 / 1
» Polynomial-Time Separation of a Superclass of Simple Comb In...
Sort
View
MOR
2006
92views more  MOR 2006»
13 years 11 months ago
Polynomial-Time Separation of a Superclass of Simple Comb Inequalities
The comb inequalities are a well-known class of facet-inducing inequalities for the Traveling Salesman Problem, defined in terms of certain vertex sets called the handle and the t...
Lisa Fleischer, Adam N. Letchford, Andrea Lodi
INFORMS
2010
100views more  INFORMS 2010»
13 years 8 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...
MOR
2010
111views more  MOR 2010»
13 years 9 months ago
Generalized Domino-Parity Inequalities for the Symmetric Traveling Salesman Problem
We extend the work of Letchford (2000) by introducing a new class of valid inequalities for the traveling salesman problem, called the generalized domino-parity (GDP) constraints....
William J. Cook, Daniel G. Espinoza, Marcos Goycoo...