Springer Science and Business Media LLC
Công bố khoa học tiêu biểu
* Dữ liệu chỉ mang tính chất tham khảo
Sắp xếp:
Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem
Springer Science and Business Media LLC - - 2001
Concave extensions for nonlinear 0–1 maximization problems
Springer Science and Business Media LLC - Tập 61 Số 1-3 - Trang 53-60 - 1993
Computing proximal points of nonconvex functions
Springer Science and Business Media LLC - Tập 116 - Trang 221-258 - 2007
The proximal point mapping is the basis of many optimization techniques for convex functions. By means of variational analysis, the concept of proximal mapping was recently extended to nonconvex functions that are prox-regular and prox-bounded. In such a setting, the proximal point mapping is locally Lipschitz continuous and its set of fixed points coincide with the critical points of the original......
Clique-circulants and the stable set polytope of fuzzy circular interval graphs
Springer Science and Business Media LLC - Tập 115 - Trang 291-317 - 2007
In this paper, we give a complete and explicit description of the rank facets of the stable set polytope for a class of claw-free graphs, recently introduced by Chudnovsky and Seymour (Proceedings of the Bristish Combinatorial Conference, 2005), called fuzzy circular interval graphs. The result builds upon the characterization of minimal rank facets for claw-free graphs by Galluccio and Sassano (J......
A method of centers algorithm for certain minimax problems
Springer Science and Business Media LLC - Tập 22 - Trang 202-226 - 1982
An algorithm is presented for the numerical solution of nonlinear programming problems in which the objective function is to be minimized over feasiblex after having been maximized over feasibley. The vectorsx andy are subjected to separate nonlinear constraints. The algorithm is obtained as follows: One starts with an ‘outer’ algorithm for the minimization overx, that algorithm being taken here t......
Breaking symmetries to rescue sum of squares in the case of makespan scheduling
Springer Science and Business Media LLC - Tập 183 - Trang 583-618 - 2020
The sum of squares (SoS) hierarchy gives an automatized technique to create a family of increasingly tight convex relaxations for binary programs. There are several problems for which a constant number of rounds of this hierarchy give integrality gaps matching the best known approximation algorithms. For many other problems, however, ad-hoc techniques give better approximation ratios than SoS in t......
Convergence of an annealing algorithm
Springer Science and Business Media LLC - Tập 34 Số 1 - Trang 111-124 - 1986
The annealing algorithm is a stochastic optimization method which has attracted attention because of its success with certain difficult problems, including NP-hard combinatorial problems such as the travelling salesman, Steiner trees and others. There is an appealing physical analogy for its operation, but a more formal model seems desirable. In this paper we present such a model and prove that th......
A combined conjugate-gradient quasi-Newton minimization algorithm
Springer Science and Business Media LLC - Tập 15 - Trang 200-210 - 1978
Although quasi-Newton algorithms generally converge in fewer iterations than conjugate gradient algorithms, they have the disadvantage of requiring substantially more storage. An algorithm will be described which uses an intermediate (and variable) amount of storage and which demonstrates convergence which is also intermediate, that is, generally better than that observed for conjugate gradient al......
Tổng số: 3,389
- 1
- 2
- 3
- 4
- 5
- 6
- 10