TOP

Papers
(The TQCC of TOP is 3. 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 2020-11-01 to 2024-11-01.)
ArticleCitations
Mathematical optimization in classification and regression trees74
Regression markets and application to energy forecasting12
Less is more: discrete starting solutions in the planar p-median problem10
Reliability assessment of a discrete time cold standby repairable system8
Tabu search tutorial. A Graph Drawing Application8
Multi-project scheduling problem under shared multi-skill resource constraints8
Day-ahead market bidding taking the balancing power market into account8
A residual recombination heuristic for one-dimensional cutting stock problems7
On the shortest $$\alpha$$-reliable path problem7
Collection of different types of milk with multi-tank tankers under uncertainty: a real case study6
A robust optimization approach for the unrelated parallel machine scheduling problem6
Meta-heuristic algorithm for aircraft pre-tactical conflict resolution with altitude and heading angle change maneuvers6
Short-term steady-state production optimization of offshore oil platforms: wells with dual completion (gas-lift and ESP) and flow assurance6
Optimal age replacement policy for discrete time parallel systems6
A column-and-constraint generation algorithm for two-stage stochastic programming problems6
Recent contributions to the optimal design of pipeline networks in the energy industry using mathematical programming5
The robust multi-plant capacitated lot-sizing problem5
Heterogeneous prestressed precast beams multiperiod production planning problem: modeling and solution methods5
Multi-objective scheduling on two dedicated processors5
Α new mixed δ-shock model with a change in shock distribution4
Alternated inertial subgradient extragradient method for equilibrium problems4
An exact lexicographic approach for the maximally risk-disjoint/minimal cost path pair problem in telecommunication networks3
Optimal inspection for missions with a possibility of abortion or switching to a lighter regime3
Reoptimisation strategies for dynamic vehicle routing problems with proximity-dependent nodes3
Generating hydro unit commitment instances3
Analysis of the selective traveling salesman problem with time-dependent profits3
Solving certain complementarity problems in power markets via convex programming3
Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem3
0.017359972000122