Showing 1 - 10 of 637
minimum weight visiting exactly k nodes. To obtain lower bounds for the traveling salesman problem the 2-matching relaxation …
Persistent link: https://www.econbiz.de/10011558810
minimum weight visiting exactly k nodes. To obtain lower bounds for the traveling salesman problem the 2-matching relaxation …
Persistent link: https://www.econbiz.de/10011723838
Persistent link: https://www.econbiz.de/10003161086
Persistent link: https://www.econbiz.de/10011558782
Persistent link: https://www.econbiz.de/10001685248
Persistent link: https://www.econbiz.de/10011725608
The elastic generalized assignment problem (eGAP) is a natural extension of the generalized assignment problem (GAP) where the capacities are not fixed but can be adjusted which is expressed by continuous variables. These variables might be un-bounded or restricted by a lower or upper bound,...
Persistent link: https://www.econbiz.de/10011558704
The elastic generalized assignment problem (eGAP) is a natural extension of the generalized assignment problem (GAP) where the capacities are not any longer fixed but can be adjusted which is expressed by continuous variables. These variables might be unbounded or restricted by a lower or upper...
Persistent link: https://www.econbiz.de/10011558706
A single round robin tournament (SRRT) consists of n teams and a set of periods. Matches between the teams have to be scheduled such that each team plays against each other team exactly once and each team plays at most once per period. In order to establish fairness among teams we consider a...
Persistent link: https://www.econbiz.de/10011558707
We introduce a new class of valid inequalities for the maximum round robin tournament (MRRT) problem. They strengthen the linear relaxation and improve the upper bound. We also answer negatively the question of Briskorn if the optimal objective value of the MRRT problem and that of its...
Persistent link: https://www.econbiz.de/10011558708