TOP

Papers
(The median citation count of TOP is 1. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2021-05-01 to 2025-05-01.)
ArticleCitations
Reoptimisation strategies for dynamic vehicle routing problems with proximity-dependent nodes20
Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem11
An integrated production planning and inventory management problem for a perishable product: optimization and Monte Carlo simulation as a tool for planning in scenarios with uncertain demands10
Multi-project scheduling problem under shared multi-skill resource constraints10
A robust optimization approach for the unrelated parallel machine scheduling problem8
A new heuristic for the Euclidean Steiner Tree Problem in $${\mathbb {R}}^n$$8
Smart and sustainable scheduling of charging events for electric buses7
A simple and effective algorithm for the maximum happy vertices problem6
Round-robin scheduling with regard to rest differences6
An approach to characterizing $$\epsilon $$-solution sets of convex programs6
The impact of convexity on expansion planning in low-carbon electricity markets5
Generating hydro unit commitment instances5
Integrating unimodality into distributionally robust optimal power flow5
Guest editorial to the Special Issue on Machine Learning and Mathematical Optimization in TOP-Transactions in Operations Research5
Interdicting facilities in tree networks5
Berge equilibria and the equilibria of the altruistic game4
Comments on: Tabu search tutorial. A Graph Drawing Application4
Heuristics for the weighted total domination problem3
Ambiguities and nonmonotonicities under prosumer power3
The target visitation arc routing problem3
A bankruptcy approach to solve the fixed cost allocation problem in transport systems3
Alternated inertial subgradient extragradient method for equilibrium problems3
Uncertain random programming models in the framework of U-S chance theory and their applications3
Directed communication in games with directed graphs3
Analysis of the selective traveling salesman problem with time-dependent profits3
An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks2
Analysis of a manufacturing queueing system using bi-level randomized policy2
Day-ahead market bidding taking the balancing power market into account2
An introduction to stochastic bin packing-based server consolidation with conflicts2
Obnoxious facility location in multiple dimensional space2
Impact analysis of flexibility on the integrated lot sizing and supplier selection problem2
Α new mixed δ-shock model with a change in shock distribution2
The DTC (difference of tangentially convex functions) programming: optimality conditions2
Wind farm layout optimization under uncertainty2
Timetable compression using max-plus automata applied to large railway networks1
Solving certain complementarity problems in power markets via convex programming1
Constraint relaxation for the discrete ordered median problem1
Optimal age replacement policy for discrete time parallel systems1
Trade-off optimization of a location-routing problem involving open routes and flexible fleet: a case study in Guadalajara, Mexico1
Regression markets and application to energy forecasting1
Construct, merge, solve and adapt1
A novel framework to construct quality indicators using the linear assignment problem1
Heuristics for flow shop rescheduling with mixed blocking constraints1
Short-term steady-state production optimization of offshore oil platforms: wells with dual completion (gas-lift and ESP) and flow assurance1
A two-phase heuristic algorithm for the label printing problem1
Adapting support vector optimisation algorithms to textual gender classification1
A residual recombination heuristic for one-dimensional cutting stock problems1
Comments on: Tabu search tutorial. A Graph Drawing Application1
Storage location assignment of steel coils in a manufacturing company: an integer linear programming model and a greedy randomized adaptive search procedure1
Cutting-plane algorithm for estimation of sparse Cox proportional hazards models1
0.084388017654419