Some basic exchange properties A combinatorial optimization problem (COP) can be described in the following way: Given a finite set E and a family of (feasible) subsets 9'~ 2' and a mapping c: E + ll?. With every FC E we associate a weight c(F): = c c(e). ccF Now the problem is to find SE .I/'s.t. c
Adjacency of the best and second best valued solutions in combinatorial optimization problems
โ Scribed by Yoshiko Ikebe; Tomomi Matsui; Akihisa Tamura
- Publisher
- Elsevier Science
- Year
- 1993
- Tongue
- English
- Weight
- 405 KB
- Volume
- 47
- Category
- Article
- ISSN
- 0166-218X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper we find estimates for the optimal constant in the critical Sobolev trace inequality ฮป 1 (โฆ ) u L 1 (โโฆ ) โค u W 1,1 (โฆ ) that are independent of โฆ . These estimates generalize those of [J. Fernandez Bonder, N. Saintier, Estimates for the Sobolev trace constant with critical exponent and
This paper presents some results regarding the design of reliable networks. The problem under consideration involves networks which are undirected graphs having equal and independent edge failure probabilities. The index of reliability is the probability that the network fails (becomes disconnected)
This paper studies the existence and uniqueness of solutions of second-order three-point boundary value problems with lower and upper solutions in the reversed order, obtains the sufficient conditions for the existence and uniqueness of solutions by use of the monotone iterative method, and gives th
We use uniform cubic polynomial splines to develop some consistency relations which are then used to develop a numerical method for computing smooth approximations to the solution and its derivatives for a system of second-order boundary value problems associated with obstacle, unilateral, and conta