A remark on “Integer linear programming formulation for a Vehicle Routing Problem” by N.R. Achutan and L. Caccetta, or how to use the Clark & Wright savings to write such integer linear programming formulations

1994 ◽  
Vol 75 (1) ◽  
pp. 238-241 ◽  
Author(s):  
Denis Naddef
Keyword(s):  
Linear Programming ◽  
Vehicle Routing ◽  
Integer Linear Programming ◽  
Vehicle Routing Problem ◽  
Programming Formulation ◽  
Routing Problem ◽  
Linear Programming Formulation ◽  
Integer Linear Programming Formulation

scholarly journals Tournaments as Feedback Arc Sets

10.37236/1214 ◽  
1995 ◽  
Vol 2 (1) ◽  
Author(s):  
Garth Isaak
Keyword(s):  
Linear Programming ◽  
Lower Bounds ◽  
Integer Linear Programming ◽  
Minimum Size ◽  
Programming Formulation ◽  
Binary Expansion ◽  
Feedback Arc Set ◽  
Disjoint Cycles ◽  
Linear Programming Formulation ◽  
Integer Linear Programming Formulation

We examine the size $s(n)$ of a smallest tournament having the arcs of an acyclic tournament on $n$ vertices as a minimum feedback arc set. Using an integer linear programming formulation we obtain lower bounds $s(n) \geq 3n - 2 - \lfloor \log_2 n \rfloor$ or $s(n) \geq 3n - 1 - \lfloor \log_2 n \rfloor$, depending on the binary expansion of $n$. When $n = 2^k - 2^t$ we show that the bounds are tight with $s(n) = 3n - 2 - \lfloor \log_2 n \rfloor$. One view of this problem is that if the 'teams' in a tournament are ranked to minimize inconsistencies there is some tournament with $s(n)$ 'teams' in which $n$ are ranked wrong. We will also pose some questions about conditions on feedback arc sets, motivated by our proofs, which ensure equality between the maximum number of arc disjoint cycles and the minimum size of a feedback arc set in a tournament.

Sign in / Sign up

Export Citation Format

Share Document