| Publication | Date of Publication | Type |
|---|
The probabilistic uncapacitated open vehicle routing location problem
Networks | 2023-12-18 | Paper |
Approximation Algorithms for Line Planning with Resource Constraints
| 2023-11-06 | Paper |
Network construction/restoration problems: cycles and complexity
Journal of Combinatorial Optimization | 2022-08-26 | Paper |
The pairwise flowtime network construction problem
Operations Research Letters | 2022-03-11 | Paper |
scientific article; zbMATH DE number 7478538 (Why is no real title available?)
| 2022-02-22 | Paper |
The \((2,1)\)-edge labeling problem on direct product of graphs.
| 2021-12-10 | Paper |
Distance constrained labelings of strong product of \(n\) general graphs.
| 2021-09-20 | Paper |
Location problems with continuous demand and unreliable facilities: applications of families of incremental Voronoi diagrams
Discrete Applied Mathematics | 2021-06-07 | Paper |
Tree optimization based heuristics and metaheuristics in network construction problems
Computers \& Operations Research | 2021-05-21 | Paper |
Minimizing the total weighted pairwise connection time in network construction problems
| 2021-04-19 | Paper |
Lateness minimization in pairwise connectivity restoration problems
INFORMS Journal on Computing | 2020-11-25 | Paper |
Tree Optimization Based Heuristics and Metaheuristics in Network Construction Problems
| 2020-07-03 | Paper |
Multi-depot traveling salesmen location problems on networks with special structure
Annals of Operations Research | 2020-05-11 | Paper |
\(L(2,1)\)-labelings on some products of \(n\) general graphs.
| 2019-12-18 | Paper |
The \(L(j,k)\)-edge-labeling problem on graphs.
| 2018-06-15 | Paper |
Cooperative covering problems on networks
Networks | 2018-05-23 | Paper |
Minimizing the makespan in multiserver network restoration problems
Networks | 2018-05-23 | Paper |
Minisum multipurpose trip location problem on trees
Networks | 2018-05-11 | Paper |
Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights
Discrete Applied Mathematics | 2018-03-21 | Paper |
\(L(2,1)\)-labeling of Kneser graphs and coloring squares of Kneser graphs
Discrete Applied Mathematics | 2017-02-27 | Paper |
The Robust (Minmax Regret) Quadratic Assignment Problem with Interval Flows
INFORMS Journal on Computing | 2017-02-17 | Paper |
Network construction problems with due dates
European Journal of Operational Research | 2016-10-06 | Paper |
Structural properties of Voronoi diagrams in facility location problems with continuous demand
Operations Research | 2015-11-20 | Paper |
Approximation algorithm for the on-line multi-customer two-level supply chain scheduling problem
Operations Research Letters | 2014-05-15 | Paper |
Semi-online two-level supply chain scheduling problems
Journal of Scheduling | 2014-02-05 | Paper |
The robust set covering problem with interval data
Annals of Operations Research | 2013-09-16 | Paper |
Batching and delivery in semi-online distribution systems
Discrete Applied Mathematics | 2012-11-22 | Paper |
Emergency path restoration problems
Discrete Optimization | 2012-07-12 | Paper |
Minmax regret bottleneck problems with solution-induced interval uncertainty structure
Discrete Optimization | 2012-06-20 | Paper |
The minmax relative regret median problem on networks
INFORMS Journal on Computing | 2012-06-18 | Paper |
Exact and heuristic algorithms for the interval data robust assignment problem
Computers \& Operations Research | 2011-03-25 | Paper |
Robust univariate spline models for interpolating interval data
Operations Research Letters | 2011-03-22 | Paper |
Nash equilibria in competitive project scheduling
European Journal of Operational Research | 2010-06-11 | Paper |
Robust univariate cubic \(L_2\) splines: Interpolating data with uncertain positions of measurements
Journal of Industrial and Management Optimization | 2010-03-22 | Paper |
On-line integrated production-distribution scheduling problems with capacitated deliveries
European Journal of Operational Research | 2009-12-14 | Paper |
Stationary analysis of a single server retrial queue with priority and vacation
International Journal of Operational Research | 2009-09-13 | Paper |
Computing and minimizing the relative regret in combinatorial optimization with interval data
Discrete Optimization | 2009-06-02 | Paper |
Explicit Reformulations for Robust Optimization Problems with General Uncertainty Sets
SIAM Journal on Optimization | 2008-12-05 | Paper |
On-line supply chain scheduling problems with preemption
European Journal of Operational Research | 2007-03-27 | Paper |
The uncapacitated facility location problem with demand-dependent setup and service costs and customer-choice allocation
European Journal of Operational Research | 2007-02-12 | Paper |
Complexity of minimizing the total flow time with interval data and minmax regret criterion
Discrete Applied Mathematics | 2006-10-30 | Paper |
The routing open-shop problem on a network: complexity and approximation
European Journal of Operational Research | 2006-06-30 | Paper |
Project scheduling under competition
Naval Research Logistics | 2006-01-23 | Paper |
The minmax regret permutation flow-shop problem with two jobs
European Journal of Operational Research | 2005-11-04 | Paper |
Facility location problems with uncertainty on the plane
Discrete Optimization | 2005-06-01 | Paper |
A \(\frac 6 5\)-approximation algorithm for the two-machine routing open-shop problem on a two-node network
European Journal of Operational Research | 2005-06-01 | Paper |
The \(m\)-machine flowshop problem with unit-time operations and intree precedence constraints
Operations Research Letters | 2005-06-01 | Paper |
On the complexity of minmax regret linear programming
European Journal of Operational Research | 2004-11-22 | Paper |
Interval data minmax regret network optimization problems
Discrete Applied Mathematics | 2004-08-06 | Paper |
Minmax regret linear resource allocation problems.
Operations Research Letters | 2004-01-05 | Paper |
Complexity of robust single facility location problems on networks with uncertain edge lengths.
Discrete Applied Mathematics | 2003-06-10 | Paper |
Minmax \(p\)-traveling salesmen location problems on a tree
Annals of Operations Research | 2003-05-04 | Paper |
An improved algorithm for the minmax regret median problem on a tree
Networks | 2003-04-10 | Paper |
Parallel NC-algorithms for multifacility location problems with mutual communication and their applications
Networks | 2002-12-17 | Paper |
A Simple Heuristic for m-Machine Flow-Shop and its Applications in Routing-Scheduling Problems
Operations Research | 2002-10-30 | Paper |
Minmax regret solutions for minimax optimization problems with uncertainty
Operations Research Letters | 2002-07-22 | Paper |
On the complexity of a class of combinatorial optimization problems with uncertainty
Mathematical Programming. Series A. Series B | 2002-02-28 | Paper |
Parallel Complexity of Additive Location Problems
INFORMS Journal on Computing | 2001-12-05 | Paper |
Algorithms for the robust 1-center problem on a tree
European Journal of Operational Research | 2000-07-09 | Paper |
Location problems with grouped structure of demand: Complexity and algorithms
| 2000-05-25 | Paper |
Algorithms for path medi-centers of a tree
Computers \& Operations Research | 2000-01-05 | Paper |
Minmax Regret Median Location on a Network Under Uncertainty
INFORMS Journal on Computing | 2000-01-01 | Paper |
Locating flow-capturing units on a network with multi-counting and diminishing returns to scale
European Journal of Operational Research | 1999-11-14 | Paper |
The plant location problem with demand-dependent setup costs and centralized allocation
European Journal of Operational Research | 1999-11-08 | Paper |
Minimax regret p-center location on a network with demand uncertainty
Location Science | 1999-03-01 | Paper |
Bottleneck Steiner Subnetwork Problems with k-Connectivity Constraints
INFORMS Journal on Computing | 1998-04-05 | Paper |
Technical Note—A Sequential Location Scheme for the Distance-Constrained Multifacility Location Problem on a Tree
Transportation Science | 1997-10-30 | Paper |
Routing Two-Machine Flowshop Problems on Networks with Special Structure
Transportation Science | 1997-09-09 | Paper |
\((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective
Discrete Applied Mathematics | 1997-08-11 | Paper |
Probabilistic Sales-Delivery Man and Sales-Delivery Facility Location Problems on a Tree
Transportation Science | 1997-01-06 | Paper |
Constrained matroidal bottleneck problems
Discrete Applied Mathematics | 1996-09-29 | Paper |
A heuristic with worst-case analysis for minimax routing of two travelling salesmen on a tree
Discrete Applied Mathematics | 1996-08-05 | Paper |
Sales‐delivery man problems on treelike networks
Networks | 1996-03-18 | Paper |
Probabilistic a priori routing-location problems
| 1996-01-30 | Paper |
Categorized bottleneck-minisum path problems on networks
Operations Research Letters | 1995-05-28 | Paper |
Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms
Mathematical Programming. Series A. Series B | 1994-11-27 | Paper |
Technical Note—Routing and Location-Routing p-Delivery Men Problems on a Path
Transportation Science | 1994-08-21 | Paper |
