Eur. J. Oper. Res 2019

28 papers

Top Research Directions

The 15 research directions with Eur. J. Oper. Res 2019 papers, ranked by paper count, next to 2018. Share is the fraction of the edition’s papers in the direction.

#Direction20192018Share 2019Share 20182018 rank
1Alternating Optimization for Joint Active and Passive Beamforming103.6%0.0%—
2Bound Based Pruning in Discrete Search Spaces103.6%0.0%—
3Efficient Algorithms for Distributionally Robust Optimization103.6%0.0%—
4Flexible Interval Scheduling for Robust Plan Execution103.6%0.0%—
5Learning Preferences Beyond the Independence of Irrelevant Alternatives103.6%0.0%—
6Navigating the Curse of Dimensionality in Sparse Text Representations103.6%0.0%—
7Network Mediated Spread and Hub Vulnerability103.6%0.0%—
8Non-Convex and Disjoint Prediction Regions103.6%0.0%—
9Overcoming the Combinatorial Explosion in Subgraph Enumeration103.6%0.0%—
10Relaxed Cohesive Subgraph Discovery in Noisy Networks103.6%0.0%—
11Scaling Combinatorial Optimization via Graph Decomposition103.6%0.0%—
12Scaling Vehicle Routing via Learning and Decomposition103.6%0.0%—
13Sparse Feature Selection via L1 Regularization103.6%0.0%—
14Stochastic Optimization for Resilient Logistics Networks103.6%0.0%—
15The Computational Complexity of Robust Optimization and Planning103.6%0.0%—

Download all directions as CSV

Institutions

Institutions credited by Eur. J. Oper. Res 2019 papers: a paper credits every institution named in its affiliations, once. 19 institutions share 7 credited papers.

#InstitutionPapersShare20182018 rank
1Centre National de la Recherche Scientifique 228.6%0—
2University of Michigan 228.6%17
3050k26q88 114.3%0—
4Australian National University 114.3%111
5ETH Zurich 114.3%130
6Georgia Institute of Technology 114.3%0—
7Laboratoire d'Informatique, de Robotique et de Microélectronique de Montpellier 114.3%0—
8LIP6 114.3%0—
9Macquarie University 114.3%0—
10Philipps University of Marburg 114.3%0—
11Rutgers, The State University of New Jersey 114.3%0—
12RWTH Aachen University 114.3%0—
13Sorbonne Université 114.3%0—
14Technische Universität Berlin 114.3%0—
15The University of Melbourne 114.3%113
16University of Freiburg 114.3%0—
17University of Siegen 114.3%0—
18Université de Montpellier 114.3%0—
19UNSW Sydney 114.3%0—

Download all institutions as CSV

About this data

Papers. Eur. J. Oper. Res 2019 lists 28 papers on Lacuna, duplicate versions counted once; rejected and withdrawn submissions are left out.

Directions. Directions are Lacuna’s clustering of the concept elements extracted from each paper, so a paper can belong to several and direction counts add up to more than the paper count. A direction’s share is its papers divided by the edition’s papers. Comparisons with 2018 use shares, since the edition went from 36 to 28 papers.

Institutions. A paper credits each institution named in its affiliations, resolved to a ROR record, once. 7 of 28 papers (25.0%) credit at least one institution and are the base for institution shares; the rest have no resolved affiliation yet.

Data. Counts come from Lacuna’s data build of 2026-11-19 and change as papers are added. Tables as CSV: directions · institutions. Cite as: Lacuna, “Eur. J. Oper. Res 2019”, https://lacuna.tiptreesystems.com/venue/eur-j-oper-res-n7ej/2019.

Top Authors

AuthorPapers
Kevin Tierney2
Bo Sun1
Chaowei Zhang1
Christian Komusiewicz1
Christophe Labreuche1
Heiner Stuckenschmidt1
Ignacio E. Grossmann1
Jacek Mańdziuk1
Jannis Kurtz1
Juan S Campos1
Pascal Van Hentenryck1
Rujun Jiang1
Ruth Misener1
Shui Yu1
Spiridon Penev1
Stefan Feuerriegel1
Stefano Coniglio1
Thibaut Vidal1
Xiao Qin1
Ya Yang1

Impactful Papers

Papers from Eur. J. Oper. Res 2019 that shaped research clusters.

Influential

Papers

Title
A branch and bound approach for large pre-marshalling problems
A data-driven newsvendor problem: From data to decision
A Monte Carlo Tree Search approach to finding efficient patrolling schemes on graphs
A multilevel analysis of the Lasserre hierarchy
A new branch-and-bound algorithm for the maximum edge-weighted clique problem
Assortment optimization under the Sequential Multinomial Logit Model
Collaborative urban transportation: Recent advances in theory and practice
Competitive search in a network
Consensus efficiency in group decision making: A comprehensive comparative study and its optimal design
Cross perishable effect on optimal inventory preservation control
Detecting fake news for reducing misinformation risks using analytics approaches
Discrete and continuous-time formulations for dealing with break periods: Preemptive and non-preemptive scheduling
Distributionally robust facility location problem under decision-dependent stochastic demand
Distributionally robust scheduling on parallel machines under moment uncertainty
Efficient solution selection for two-stage stochastic programs
Exact algorithms for finding well-connected 2-clubs in sparse real-world graphs: Theory and experiments
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
Integrated planning for design and production in two-stage recycling operations
Integrating berth allocation decisions in a fleet composition and periodic routing problem of platform supply vessels
News-based forecasts of macroeconomic indicators: A semantic path model for interpretable predictions
On importance indices in multicriteria decision making
Optimal battery purchasing and charging strategy at electric vehicle battery swap stations
Police staffing and workload assignment in law enforcement using multi-server queueing models
Quadratic convex reformulation for quadratic programming with linear on-off constraints
Routing a mix of conventional, plug-in hybrid, and electric vehicles
The impact of model risk on dynamic portfolio selection under multi-period mean-standard-deviation criterion
Top-κ selection with pairwise comparisons
Working capital optimization in a supply chain perspective