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:  
Concave extensions for nonlinear 0–1 maximization problems
Springer Science and Business Media LLC - Tập 61 Số 1-3 - Trang 53-60 - 1993
Yves Crama
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
Gianpaolo Oriolo, Gautier Stauffer
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...... hiện toàn bộ
Smoothed performance guarantees for local search
Springer Science and Business Media LLC - - 2014
Tobias Brunsch, Heiko Röglin, Cyriel Rutten, Tjark Vredeveld
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
Victor Verdugo, José Verschae, Andreas Wiese
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...... hiện toàn bộ
A combined conjugate-gradient quasi-Newton minimization algorithm
Springer Science and Business Media LLC - Tập 15 - Trang 200-210 - 1978
A. G. Buckley
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...... hiện toàn bộ
The mathematical programming society
Springer Science and Business Media LLC - Tập 9 - Trang 137-137 - 1975
Designation of new Editor-in-Chief
Springer Science and Business Media LLC - Tập 18 - Trang 108-108 - 1980
Some upper and lower bounds on PSD-rank
Springer Science and Business Media LLC - Tập 162 - Trang 495-521 - 2016
Troy Lee, Zhaohui Wei, Ronald de Wolf
Positive semidefinite rank (PSD-rank) is a relatively new complexity measure on matrices, with applications to combinatorial optimization and communication complexity. We first study several basic properties of PSD-rank, and then develop new techniques for showing lower bounds on the PSD-rank. All of these bounds are based on viewing a positive semidefinite factorization of a matrix M as a quantum...... hiện toàn bộ
The Mathematical Programming Society
Springer Science and Business Media LLC - - 1978
The effect of deterministic noise in subgradient methods
Springer Science and Business Media LLC - - 2010
Angelia Nedić, Dimitri P. Bertsekas
Tổng số: 3,389   
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 10