Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDComputational Optimization and Applications, Volume 69
Volume 69, Number 1, January 2018
- Lluís-Miquel Munguía, Shabbir Ahmed
, David A. Bader, George L. Nemhauser, Yufen Shao:
Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs. 1-24 - Douglas M. King, Sheldon H. Jacobson, Edward C. Sewell:
The geo-graph in practice: creating United States Congressional Districts from census blocks. 25-49 - Ernesto G. Birgin, Gabriel Haeser, Alberto Ramos:
Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points. 51-75 - Jianjun Liu, Xiangmin Xu, Xuehui Cui:
An accelerated nonmonotone trust region method with adaptive trust region for unconstrained optimization. 77-97 - Francisco J. Aragón Artacho, Rubén Campoy:
A new projection method for finding the closest point in the intersection of convex sets. 99-132 - Haibin Chen, Zheng-Hai Huang, Liqun Qi:
Copositive tensor detection and its applications in physics and hypergraphs. 133-158 - Franz Rendl, Renata Sotirov:
The min-cut and vertex separator problem. 159-187 - William W. Hager, James T. Hungerford, Ilya Safro:
A multilevel bilinear programming algorithm for the vertex separator problem. 189-223 - Anders Forsgren, Tove Odland:
On exact linesearch quasi-Newton methods for minimizing a quadratic function. 225-241 - Milan Hladík:
Bounds for the solutions of absolute value equations. 243-266
Volume 69, Number 2, March 2018
- Guido Cocchi, Giampaolo Liuzzi, Anthony Papini, Marco Sciandrone:
An implicit filtering algorithm for derivative-free multiobjective optimization with box constraints. 267-296 - Bo Wen, Xiaojun Chen, Ting Kei Pong:
A proximal difference-of-convex algorithm with extrapolation. 297-324 - Andreas Fischer, Markus Herrich, Alexey F. Izmailov, Wladimir Scheck, Mikhail V. Solodov:
A globally convergent LP-Newton method for piecewise smooth constrained equations: escaping nonstationary accumulation points. 325-349 - Waltraud Huyer, Arnold Neumaier:
MINQ8: general definite and bound constrained indefinite quadratic programming. 351-381 - Siamak Yousefi, Xiao-Wen Chang, Henk Wymeersch, Benoît Champagne, Godfried Toussaint:
A novel approach for ellipsoidal outer-approximation of the intersection region of ellipses in the plane. 383-402 - Teresa Scarinci, Vladimir M. Veliov:
Higher-order numerical scheme for linear quadratic problems with bang-bang controls. 403-422 - Souvik Roy, Mario Annunziato, Alfio Borzì, Christian Klingenberg:
A Fokker-Planck approach to control collective motion. 423-459 - Xiaoliang Song, Bo Chen, Bo Yu:
An efficient duality-based approach for PDE-constrained sparse optimization. 461-500 - Gonzalo Muñoz, Daniel G. Espinoza, Marcos Goycoolea, Eduardo Moreno, Maurice Queyranne, Orlando Rivera Letelier:
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling. 501-534 - Mahdi Noorizadegan, Abbas Seifi:
An efficient computational method for large scale surgery scheduling problems with chance constraints. 535-561
Volume 69, Number 3, April 2018
- Hao-Hsiang Wu, Simge Küçükyavuz:
A two-stage stochastic programming approach for influence maximization in social networks. 563-595 - Hiva Ghanbari, Katya Scheinberg:
Proximal quasi-Newton methods for regularized convex optimization with linear and accelerated sublinear convergence rates. 597-627 - Leonardo Galli, Christian Kanzow, Marco Sciandrone:
A nonmonotone trust-region method for generalized Nash equilibrium and related problems with strong convergence properties. 629-652 - Jamie Fairbrother, Adam N. Letchford, Keith Briggs:
A two-level graph partitioning problem arising in mobile wireless communications. 653-676 - José F. S. Bravo Ferreira, Yuehaw Khoo, Amit Singer:
Semidefinite programming approach for the quadratic assignment problem with a sparse graph. 677-712 - Markus Leitner, Ivana Ljubic, Martin Luipersbeck, Markus Sinnl:
Decomposition methods for the two-stage stochastic Steiner tree problem. 713-752 - Sara Mattia, Michael Poss:
A comparison of different routing schemes for the robust network loading problem: polyhedral results and computation. 753-800 - Christian Kanzow, Daniel Steck:
Augmented Lagrangian and exact penalty methods for quasi-variational inequalities. 801-824 - Walter Alt, Ursula Felgenhauer, Martin Seydenschwanz:
Euler discretization for a class of nonlinear optimal control problems with control appearing linearly. 825-856 - Veronika Karl, Daniel Wachsmuth:
An augmented Lagrange method for elliptic state constrained optimal control problems. 857-880
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-07-02 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
