default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEURO Journal on Computational Optimization, Volume 7
Volume 7, Number 1, March 2019
- Timo Berthold, Andrea Lodi
, Domenico Salvagnin:
Ten years of feasibility pump, and counting. 1-14 - Christina Büsing, Sebastian Goderbauer, Arie M. C. A. Koster, Manuel Kutschka:
Formulations and algorithms for the recoverable Γ-robust knapsack problem. 15-45 - Thiago Gouveia da Silva, Serigne Gueye, Philippe Michelon, Luiz Satoru Ochi, Lucídio dos Anjos Formiga Cabral:
A polyhedral approach to the generalized minimum labeling spanning tree problem. 47-77 - Janne Sorsa:
Real-time algorithms for the bilevel double-deck elevator dispatching problem. 79-122
Volume 7, Number 2, June 2019
- Vilmar Jefté Rodrigues de Sousa, Miguel F. Anjos, Sébastien Le Digabel:
Improving the linear relaxation of maximum k-cut with semidefinite-based constraints. 123-151 - Xiaolong Kuang, Bissan Ghaddar, Joe Naoum-Sawaya, Luis F. Zuluaga:
Alternative SDP and SOCP approximations for polynomial optimization. 153-175 - Cláudio P. Santiago, Sérgio Assunção Monteiro, Helder Inácio, Nelson Maculan, Maria Helena Jardim:
An efficient algorithm for the projection of a point on the intersection of two hyperplanes and a box in \(\mathbb {R}^n\). 177-207
Volume 7, Number 3, September 2019
- Achim Hildenbrandt:
A branch-and-cut algorithm for the target visitation problem. 209-242 - Serdar Kadioglu:
Core group placement: allocation and provisioning of heterogeneous resources. 243-264 - François Clautiaux, Ruslan Sadykov, François Vanderbeck, Quentin Viaud:
Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers. 265-297 - Falk M. Hante, Martin Schmidt:
Complementarity-based nonlinear programming techniques for optimal mixing in gas networks. 299-323
Volume 7, Number 4, December 2019
- Dalia Attia, Reinhard Bürgy, Guy Desaulniers, François Soumis:
A decomposition-based heuristic for large employee scheduling problems with inter-department transfers. 325-357 - Jean-Pierre Dussault, Mathieu Frappier, Jean Charles Gilbert:
A lower bound on the iterative complexity of the Harker and Pang globalization technique of the Newton-min algorithm for solving the linear complementarity problem. 359-380 - Renke Kuhlmann:
Learning to steer nonlinear interior-point methods. 381-419 - Philippe Lacomme, Aziz Moukrim, Alain Quilliot, Marina Vinot:
Integration of routing into a resource-constrained project scheduling problem. 421-464
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 2025-04-04 23:26 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:
