| Network construction/restoration problems: cycles and complexity | 0 | 0.34 | 2022 |
| Tree Optimization Based Heuristics And Metaheuristics In Network Construction Problems | 1 | 0.35 | 2021 |
| Location Problems With Continuous Demand And Unreliable Facilities: Applications Of Families Of Incremental Voronoi Diagrams | 0 | 0.34 | 2021 |
| Multi-depot traveling salesmen location problems on networks with special structure | 0 | 0.34 | 2020 |
| Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights. | 0 | 0.34 | 2018 |
| The L(j, k)-Edge-Labeling Problem on Graphs. | 0 | 0.34 | 2018 |
| Lateness Minimization In Pairwise Connectivity Restoration Problems | 1 | 0.35 | 2018 |
| L(2, 1)-Labeling of Kneser graphs and coloring squares of Kneser graphs. | 1 | 0.36 | 2017 |
| Minimizing the makespan in multiserver network restoration problems. | 0 | 0.34 | 2017 |
| Labeling Dot-Cartesian and Dot-Lexicographic Product Graphs with a Condition at Distance Two. | 0 | 0.34 | 2016 |
| Network construction problems with due dates. | 7 | 0.59 | 2015 |
| The Robust Set Covering Problem with interval data. | 8 | 0.61 | 2013 |
| Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem | 5 | 0.44 | 2013 |
| Batching and delivery in semi-online distribution systems | 2 | 0.37 | 2013 |
| Emergency path restoration problems. | 9 | 0.65 | 2012 |
| Semi-online two-level supply chain scheduling problems | 10 | 0.53 | 2012 |
| Exact and heuristic algorithms for the interval data robust assignment problem | 7 | 0.45 | 2011 |
| Robust univariate spline models for interpolating interval data | 1 | 0.38 | 2011 |
| Minmax regret bottleneck problems with solution-induced interval uncertainty structure | 3 | 0.42 | 2010 |
| On-line integrated production–distribution scheduling problems with capacitated deliveries | 18 | 0.75 | 2010 |
| Nash equilibria in competitive project scheduling | 4 | 0.47 | 2010 |
| Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets | 14 | 0.85 | 2008 |
| The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation | 1 | 0.36 | 2007 |
| On-line supply chain scheduling problems with preemption | 22 | 0.99 | 2007 |
| The minmax regret permutation flow-shop problem with two jobs | 9 | 0.59 | 2006 |
| The routing open-shop problem on a network: Complexity and approximation | 9 | 0.70 | 2006 |
| The competitive salesman problem on a network: a worst-case approach | 1 | 0.42 | 2006 |
| Complexity of minimizing the total flow time with interval data and minmax regret criterion | 35 | 1.67 | 2006 |
| The Minmax Relative Regret Median Problem on Networks | 4 | 0.42 | 2005 |
| Facility location problems with uncertainty on the plane | 19 | 0.76 | 2005 |
| The m-machine flowshop problem with unit-time operations and intree precedence constraints | 1 | 0.78 | 2005 |
| On the complexity of minmax regret linear programming | 25 | 1.29 | 2005 |
| A 6/5-approximation algorithm for the two-machine routing open-shop problem on a two-node network | 4 | 0.49 | 2005 |
| Computing and minimizing the relative regret in combinatorial optimization with interval data | 15 | 0.80 | 2005 |
| Minmax regret linear resource allocation problems | 5 | 0.83 | 2004 |
| Interval data minmax regret network optimization problems | 68 | 2.94 | 2004 |
| An improved algorithm for the minmax regret median problem on a tree | 24 | 1.27 | 2003 |
| Complexity of robust single facility location problems on networks with uncertain edge lengths | 15 | 1.04 | 2003 |
| Parallel NC-algorithms for multifacility location problems with mutual communication and their applications | 0 | 0.34 | 2002 |
| Minmax p-Traveling Salesmen Location Problems on a Tree | 12 | 0.77 | 2002 |
| On the complexity of a class of combinatorial optimization problems with uncertainty | 87 | 7.58 | 2001 |
| Minmax regret solutions for minimax optimization problems with uncertainty | 47 | 3.41 | 2000 |
| Algorithms for the robust 1-center problem on a tree | 36 | 2.22 | 2000 |
| Minmax Regret Median Location on a Network Under Uncertainty | 35 | 1.97 | 2000 |
| A Simple Heuristic for M-Machine Flow-Shop and its Applications in Routing-Scheduling Problems | 14 | 0.94 | 1999 |
| Algorithms for path medi-centers of a tree | 19 | 0.82 | 1999 |
| Parallel Complexity of Additive Location Problems | 0 | 0.34 | 1999 |
| The plant location problem with demand-dependent setup costs and centralized allocation | 6 | 0.59 | 1998 |
| Location problems with grouped structure of demand: Complexity and algorithms | 1 | 0.36 | 1998 |
| (P-1)/(P+1)-Approximate Algorithms For P-Traveling Salesmen Problems On A Tree With Minmax Objective | 5 | 0.80 | 1997 |
