default search action
EURO Journal on Computational Optimization, Volume 11
Volume 11, January 2023
- Hemen Sanati, Ghasem Moslehi, Mohammad Reisi-Nafchi:
Unrelated parallel machine energy-efficient scheduling considering sequence-dependent setup times and time-of-use electricity tariffs. 100052 - Vanessa Lange, Hans Daduna:
The Weber problem in logistic and services networks under congestion. 100056 - Kabiru Ahmed, Mohammed Yusuf Waziri, Abubakar Sani Halilu, Salisu Murtala:
On two symmetric Dai-Kou type schemes for constrained monotone equations with image recovery application. 100057 - Vassilios Yfantis, Simon Wenzel, Achim Wagner, Martin Ruskowski, Sebastian Engell:
Hierarchical distributed optimization of constraint-coupled convex and mixed-integer programs using approximations of the dual function. 100058 - Goran Vojvodic, Luis J. Novoa, Ahmad I. Jarrah:
Experimentation with Benders decomposition for solving the two-timescale stochastic generation capacity expansion problem. 100059
- Derek H. Smith, Roberto Montemanni:
The missing Moore graph as an optimization problem. 100060
- Jake Weiner, Andreas T. Ernst, Xiaodong Li, Yuan Sun:
Ranking constraint relaxations for mixed integer programs using a machine learning approach. 100061
- Mauro Passacantando, Fabio Raciti, Anna Nagurney:
International migrant flows: Coalition formation among countries and social welfare. 100062
- Maximilian Löffler, Enrico Bartolini, Michael Schneider:
A conceptually simple algorithm for the capacitated location-routing problem. 100063
- Coralia Cartis, Panayotis Mertikopoulos:
Optimization Challenges in Data Science - Special Issue Editorial. 100064
- Immanuel M. Bomze:
The Marguerite Frank Award for the best EJCO paper 2022. 100065
- Gioni Mexi, Timo Berthold, Domenico Salvagnin:
Using multiple reference vectors and objective scaling in the Feasibility Pump. 100066 - Majid H. M. Chauhdry:
A framework using nested partitions algorithm for convergence analysis of population distribution-based methods. 100067 - Xavier Warin:
Reservoir optimization and machine learning methods. 100068
- Sahand Asgharieh Ahari, Burak Kocuk:
A mixed-integer exponential cone programming formulation for feature subset selection in logistic regression. 100069 - Annabella Astorino, Matteo Avolio, Antonio Fuduli:
Maximum-margin polyhedral separation for binary Multiple Instance Learning. 100070
- Sven Mallach:
Binary programs for asymmetric betweenness problems and relations to the quadratic linear ordering problem. 100071
- Tibor Illés, Petra Renáta Rigó, Roland Török:
Large-step predictor-corrector interior point method for sufficient linear complementarity problems based on the algebraic equivalent transformation. 100072 - Ahmadreza Marandi, Virginie Lurkin:
An exact algorithm for the static pricing problem under discrete mixed logit demand. 100073
- Liding Xu, Claudia D'Ambrosio, Sonia Haddad-Vanier, Emiliano Traversi:
Branch and price for submodular bin packing. 100074
- Gabriella Colajanni, Patrizia Daniele, Daniele Sciacca:
A variational approach for supply chain networks with environmental interests. 100075
- Ashenafi Awraris, Berhanu Guta Wordofa, Semu Mitiku Kassa:
Branch-and-cut solution approach for multilevel mixed integer linear programming problems. 100076
- Tiago Dias, Paula Amaral:
A classification method based on a cloud of spheres. 100077
- Roberto Montemanni, Mauro Dell'Amico:
Constraint programming models for the parallel drone scheduling vehicle routing problem. 100078
- Sara Venturini, Andrea Cristofari, Francesco Rinaldi, Francesco Tudisco:
Laplacian-based semi-Supervised learning in multilayer hypergraphs by coordinate descent. 100079
- Rafael Kendy Arakaki, Fábio Luiz Usberti:
A parameterized lower bounding method for the open capacitated arc routing problem. 100080
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.