We derive new upper bounds for the classical two-color Ramsey numbers \(R(4,5) \leqslant 27, R(5,5) \leqslant 52\), and \(R(4,6) \leqslant 43\); the previous best upper bounds known for these numbers were 28,53 , and 44 , respectively. The new bounds are obtained by solving large integer linear prog
On a certain problem in linear programming
β Scribed by R. J. Taylor; S. P. Thompson
- Publisher
- John Wiley and Sons
- Year
- 1958
- Tongue
- English
- Weight
- 474 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
## Abstract Linear programming has many worthwhile applications to transportation problems of a relatively uncomplicated nature. For inore complicated problems, however, a realistic linearβprogramming formulation can require such an excessive number of variables that obtaining a solution is not fea
## Abstract In this article, a mixed integer bilevel problem having a probabilistic knapsack constraint in the first level is proposed. The problem formulation is mainly motivated by practical pricing and service provision problems as it can be interpreted as a model for the interaction between a s